附註:Includes bibliographical references and indexes.
The basics -- Matching -- Connectivity -- Planar graphs -- Colouring -- Flows -- Substructures in dense graphs -- Substructures in sparse graphs -- Ramsey theory for graphs -- Hamilton cycles -- Random graphs -- Minors, trees, and WQO.
摘要:This book is a concise, yet carefully written, introduction to modern graph theory, covering all its recent developments. It can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more advanced methods of that field. This second edition extends the first in two ways. It offers a thoroughly revised and updated chapter on graph minors, which now includes full new proofs of two of the central Robertson-Seymor theorems (as well as a detailed sketch of the entire proof of their celebrated Graph Minor Theorem). Second, there is now a section of hints for all the exercises, to enhance their value for bith individual study and classroom use.
