这本书的主要目的是提出一个连贯的介绍图论,适合作为一本教科书为高等本科和在数学和计算机科学研究生。它提供了一个系统的处理图的理论,而不牺牲其直观和审美的吸引力。大量使用的证明技术被描述和说明,并且提供了大量的练习——不同难度的练习——帮助读者掌握这些技术并加强他们对材料的掌握。
Individual chapters: Preface Contents Chapter 1: Graphs and Subgraphs Chapter 2: Trees Chapter 3: Connectivity Chapter 4: Euler Tours and Hamilton Cycles Chapter 5: Matchings Chapter 6: Edge Colourings Chapter 7: Independent Sets and Cliques Chapter 8: Vertex Colourings Chapter 9: Planar Graphs Chapter 10: Directed Graphs Chapter 11: Networks Chapter 12: The Cycle Space and Bond Space Appendix 1: Hints to Starred Exercises Appendix II: Four Graphs and a Table of their Properties Appendix III: Some Interesting Graphs Appendix IV: Unsolved Problems Appendix V: Suggestions for Further Reading Glossary of Symbols Index