|
|
Sold Out
Book Categories |
| Preface | vii | |
| Basic Definitions | xiii | |
| Chapter 1 | Connectivity | 1 |
| 1. | Elementary Properties | 2 |
| 2. | Menger's Theorem and its Consequences | 7 |
| 3. | The Structure of 2- and 3-Connected Graphs | 11 |
| 4. | Minimally k-Connected Graphs | 17 |
| 5. | Graphs with Given Maximal Local Connectivity | 29 |
| 6. | Exercises, Problems and Conjectures | 45 |
| Chapter 2 | Matching | 50 |
| 1. | Fundamental Matching Theorems | 52 |
| 2. | The Number of 1-Factors | 59 |
| 3. | f-Factors | 67 |
| 4. | Matching in Graphs with Restrictions on the Degrees | 79 |
| 5. | Coverings | 90 |
| 6. | Exercises, Problems and Conjectures | 95 |
| Chapter 3 | Cycles | 102 |
| 1. | Graphs with Large Minimal Degree and Large Girth | 103 |
| 2. | Vertex Disjoint Cycles | 110 |
| 3. | Edge Disjoint Cycles | 119 |
| 4. | The Circumference | 131 |
| 5. | Graphs with Cycles of Given Lengths | 147 |
| 6. | Exercises, Problems and Conjectures | 161 |
| Chapter 4 | The Diameter | 169 |
| 1. | Diameter, Maximal Degree and Size | 170 |
| 2. | Diameter and Connectivity | 181 |
| 3. | Graphs with Large Subgraphs of Small Diameter | 194 |
| 4. | Factors of Small Diameter | 206 |
| 5. | Exercises, Problems and Conjectures | 213 |
| Chapter 5 | Colourings | 218 |
| 1. | General Colouring Theorems | 221 |
| 2. | Critical k-Chromatic Graphs | 234 |
| 3. | Colouring Graphs on Surfaces | 243 |
| 4. | Sparse Graphs of Large Chromatic Number | 254 |
| 5. | Perfect Graphs | 263 |
| 6. | Ramsey Type Theorems | 270 |
| 7. | Exercises, Problems and Conjectures | 280 |
| Chapter 6 | Complete Subgraphs | 292 |
| 1. | The Number of Complete Subgraphs | 293 |
| 2. | Complete Subgraphs of r-Partite Graphs | 309 |
| 3. | The Structure of Graphs | 327 |
| 4. | The Structure of Extremal Graphs without Forbidden Subgraphs | 339 |
| 5. | Independent Complete Subgraphs | 351 |
| 6. | Exercises, Problems and Conjectures | 359 |
| Chapter 7 | Topological Subgraphs | 368 |
| 1. | Contractions | 369 |
| 2. | Topological Complete Subgraphs | 378 |
| 3. | Semi-Topological Subgraphs | 386 |
| 4. | Exercises, Problems and Conjectures | 397 |
| Chapter 8 | Complexity and Packing | 401 |
| 1. | The Complexity of Graph Properties | 402 |
| 2. | Monotone Properties | 411 |
| 3. | The Main Packing Theorem | 418 |
| 4. | Packing Graphs of Small Size | 425 |
| 5. | Applications of Packing Results to Complexity | 429 |
| 6. | Exercises, Problems and Conjectures | 434 |
| References | 438 | |
| Index of Symbols | 481 | |
| Index of Definitions | 485 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Rob Young
reviewed Extremal Graph Theory on January 06, 2014
Extremal Graph Theory
Not a read just for fun but a great book/text if you like calculus and/or chaos
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Extremal Graph Theory
X
This Item is in Your Inventory
Extremal Graph Theory
X
You must be logged in to review the productsX
X
X
Add Extremal Graph Theory, The ever-expanding field of extremal graph theory encompasses an array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume presents a concise yet comprehensive treatment, featuring comple, Extremal Graph Theory to the inventory that you are selling on WonderClubX
X
Add Extremal Graph Theory, The ever-expanding field of extremal graph theory encompasses an array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume presents a concise yet comprehensive treatment, featuring comple, Extremal Graph Theory to your collection on WonderClub |
