| |
| |
Preface | |
| |
| |
Basic Definitions | |
| |
| |
| |
Connectivity | |
| |
| |
| |
Elementary Properties | |
| |
| |
| |
Menger's Theorem and its Consequences | |
| |
| |
| |
The Structure of 2- and 3-Connected Graphs | |
| |
| |
| |
Minimally k-Connected Graphs | |
| |
| |
| |
Graphs with Given Maximal Local Connectivity | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
Matching | |
| |
| |
| |
Fundamental Matching Theorems | |
| |
| |
| |
The Number of 1-Factors | |
| |
| |
| |
f-Factors | |
| |
| |
| |
Matching in Graphs with Restrictions on the Degrees | |
| |
| |
| |
Coverings | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
Cycles | |
| |
| |
| |
Graphs with Large Minimal Degree and Large Girth | |
| |
| |
| |
Vertex Disjoint Cycles | |
| |
| |
| |
Edge Disjoint Cycles | |
| |
| |
| |
The Circumference | |
| |
| |
| |
Graphs with Cycles of Given Lengths | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
The Diameter | |
| |
| |
| |
Diameter, Maximal Degree and Size | |
| |
| |
| |
Diameter and Connectivity | |
| |
| |
| |
Graphs with Large Subgraphs of Small Diameter | |
| |
| |
| |
Factors of Small Diameter | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
Colourings | |
| |
| |
| |
General Colouring Theorems | |
| |
| |
| |
Critical k-Chromatic Graphs | |
| |
| |
| |
Colouring Graphs on Surfaces | |
| |
| |
| |
Sparse Graphs of Large Chromatic Number | |
| |
| |
| |
Perfect Graphs | |
| |
| |
| |
Ramsey Type Theorems | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
Complete Subgraphs | |
| |
| |
| |
The Number of Complete Subgraphs | |
| |
| |
| |
Complete Subgraphs of r-Partite Graphs | |
| |
| |
| |
The Structure of Graphs | |
| |
| |
| |
The Structure of Extremal Graphs without Forbidden Subgraphs | |
| |
| |
| |
Independent Complete Subgraphs | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
Topological Subgraphs | |
| |
| |
| |
Contractions | |
| |
| |
| |
Topological Complete Subgraphs | |
| |
| |
| |
Semi-Topological Subgraphs | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
| |
Complexity and Packing | |
| |
| |
| |
The Complexity of Graph Properties | |
| |
| |
| |
Monotone Properties | |
| |
| |
| |
The Main Packing Theorem | |
| |
| |
| |
Packing Graphs of Small Size | |
| |
| |
| |
Applications of Packing Results to Complexity | |
| |
| |
| |
Exercises, Problems and Conjectures | |
| |
| |
References | |
| |
| |
Index of Symbols | |
| |
| |
Index of Definitions | |