The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.
Preface; 1 Graphs and Their Complements; 2 Paths and Walks; 3 Subgraphs; 4 Some Special Classes of Graphs; 5 Trees and Cycles; 6 The Structure of Trees; 7 Connectivity; 8 Graphs and Symmetry; 9 Alternating Paths and Matchings; 10 Network Flows; 11 Hamilton Cycles; 12 Digraphs; 13 Graph Colorings; 14 Planar Graphs; 15 Graphs and Surfaces; 16 The Klein Bottle and the Double Torus; 17 Linear Programming; 18 The Primal-Dual Algorithm; 19 Discrete Linear Programming; Bibliography; Index