1 Graphs 1
2 Subgraphs 39
3 Connected Graphs 79
4 Trees 99
5 Nonseparable Graphs 117
6 Tree-Search Algorithms 135
7 Flows in Networks 157
8 Complexity of Algorithms 173
9 Connectivity 205
10 Planar Graphs 243
11 The Four-Colour Problem 287
12 Stable Sets and Cliques 295
13 The Probabilistic Method 329
14 Vertex Colourings 357
15 Colourings of Maps 391
16 Matchings 413
17 Edge Colourings 451
18 Hamilton Cycles 471
19 Coverings and Packings in Directed Graphs 503
20 Electrical Networks 527
21 Integer Flows and Coverings 557
Unsolved Problems 583
References 593
General Mathematical Notation 623
Graph Parameters 625
Operations and Relations 627
Families of Graphs 629
Structures 631
Other Notation 633
Index 637