Apol Prefaee I Fundamentak I.1 Definitions I.2 Paths, Cycles, and Trees I.3 Hamilton Cycles and Euler Circuits I.4 Planar Oraphs I.5 An Application of Euler Trails to Algebra I.6 6xercises II Electrieal Networks II. l Graplls and Electrical Networks II.2 Squaring the Square II.3 Vector Spaces and Matrices associated with Graphs II.4 Exercises II.5 Notes I II Flowss Connectivity and Nlatehing III.1 Flows in Directed Graphs III.2 Connectivity and Menger's Theorem III.3 Matching III.4 Tutte's l-Factor Theorem III.5 Stable Matchings III.6 Exercises III.7 Notes IV Extn IV.l Paths and Cycles IV.2 Complete Subgraphs IV.3 Hamilton Paths and Cycles IV.4 The Structure of Oraphs IV.5 Szemeredi's Regularity LemnTa IV.6 Simple Applications of Szemersdi's Lemma IV.7 Exercises IV.8 Notes V Colouring V.l Vertex Colouring V.2 Edge Colouring V.3 Graphs on Surfaces V.4 List Colouring V.5 Perfect Oraplls V.6 Exercises V.7 Notes VI Ramsey Theory VIII.4 Enumeration and P61ya's Theorem VIII.5 Exercises IX Random Walks on Graphs IX.l Electrical Networks Revisited IX.2 Electrical Networks and Random Walks IX.3 Hitting Times and Commute Times IX.4 Conductance and Rapid Mixing IX.5 Exercises IX.6 Notes X The Tutte Polynomial X. l Basic Propenies of the Tutte Polynomial X.2 The Universal Form of the Tutte Polynomial X.3 The Tutte Polynomial in Statistical Mechanics X.4 Special Values of the Tutte Polynomial X.5 A Spanning Tree Expansion of the Tutte Polynomial X.6 Polynomials of Knots and Links X.7 Exercises X.8 Notes Symbol Index Name Index Subject Index
京公网安备 11010102004214号