اللغة:
שפה נוכחית
سجل الدخول باستخدام غوغل
تسجيل الدخول باستخدام فاسيبوك
Topics in structural graph theory [electronic resource] edited by Lowell W. Beineke, Robin J. Wilson
لتكبير النص لتصغير النص- كتاب
No other book covers such a wide scope of this aspect of graph theory.
| العنوان |
Topics in structural graph theory [electronic resource] edited by Lowell W. Beineke, Robin J. Wilson. |
|---|---|
| الناشر |
Cambridge, England : Cambridge University Press |
| تاريخ الإصدار |
c2013 |
| ملاحظات |
Description based upon print version of record. Includes bibliographical references at the end of each chapters and index. English |
| رقم الرف |
Cover Topics in Structural Graph Theory Series Page Title Copyright Contents Foreword Preface Preliminaries 1. Graph theory Graphs Adjacency and degrees Isomorphisms and automorphisms Walks, paths and cycles Connectedness and distance Bipartite graphs and trees Special graphs Operations on graphs Subgraphs and minors Digraphs 2. Connectivity Vertex-connectivity Edge-connectivity 3. Flows in networks References 1 Menger's theorem 1. Introduction 2. Vertex-connectivity 3. Edge-connectivity 4. Mixed connectivity Connectivity pairs Edge-disjoint skeins 5. Average connectivityAverage vertex-connectivity Uniformly connected graphs Average edge-connectivity Average connectivity of digraphs 6. Menger results for paths of bounded length Short paths Menger path systems Long paths 7. Connectivity of sets Total separation Disconnecting a graph into more than two components 8. Connecting with trees Edge-disjoint trees Internally disjoint trees 2 Maximally connected graphs 2. Maximally edge-connected graphs Degree conditions Diameter and girth conditions Clique number conditions Cages 3 Minimal connectivity1. Introduction 2. Edge-deletion 3. Vertex-deletion 4. Edge-contraction 5. Generalized criticality 6. Reduction methods Contractible edges Dawes constructions Splitting and soldering Miscellaneous reductions 7. Subgraph-deletion 8. Partitions under connectivity constraints 9. Line graphs 4 Contractions of k-connected graphs 2. Contractible edges in 3-connected graphs 3. Contractible edges in 4-connected graphs 4. Contractible edges in k-connected graphs 5. Contraction-critical 5-connected graphs 6. Local structure and contractible edges7. Concluding remarks 5 Connectivity and cycles 2. Generalizations of classical results 3. Relative lengths of paths and cycles 4. Regular graphs 5. Bipartite graphs 6. Claw-free graphs 7. Planar graphs 8. The Chvátal-Erdős condition 9. Ordered graphs 10. Numbers of cycles 6 H-linked graphs 2. k-linked graphs 3. Weak linkage 4. Digraphs 5. Modulo and parity linkage 6. Disjoint connected subgraphs 7. The disjoint paths problem 8. H-linked graphs 9. H-extendible graphs References |
| سلسلة |
Encyclopedia of Mathematics and its Applications 147 |
| الشكل |
1 online resource (344 p.) |
| اللغة |
الانكليزية |
| رقم النظام |
997010708945005171 |
MARC RECORDS
أتعرفون المزيد عن هذا العنصر؟ وجدتم خطأ ما؟
