The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory.
Author(s): Adrian Bondy, U.S.R Murty
Series: Graduate Texts in Mathematics
Edition: 3rd Corrected Printing.
Publisher: Springer
Year: 2008
Language: English
Commentary: Lacks Appendix B
Pages: 655
Graduate Texts in Mathematics 244......Page 2
Graph Theory......Page 4
Preface......Page 7
Contents......Page 11
1 Graphs......Page 13
2 Subgraphs......Page 50
3 Connected Graphs......Page 89
4 Trees......Page 109
5 Nonseparable Graphs......Page 126
6 Tree-Search Algorithms......Page 143
7 Flows in Networks......Page 165
8 Complexity of Algorithms......Page 181
9 Connectivity......Page 213
10 Planar Graphs......Page 250
11 The Four-Colour Problem......Page 293
12 Stable Sets and Cliques......Page 301
13 The Probabilistic Method......Page 334
14 Vertex Colourings......Page 362
15 Colourings of Maps......Page 396
16 Matchings......Page 417
17 Edge Colourings......Page 455
18 Hamilton Cycles......Page 475
19 Coverings and Packings in Directed Graphs......Page 507
20 Electrical Networks......Page 531
21 Integer Flows and Coverings......Page 561
Unsolved Problems......Page 587
References......Page 596
General Mathematical Notation......Page 626
Graph Parameters......Page 628
Operations and Relations......Page 630
Families of Graphs......Page 632
Structures......Page 633
Other Notation......Page 635
Index......Page 638
