Synopses & Reviews
This standard textbook of modern graph theory, now in its fourth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory." Acta Scientiarum Mathematiciarum "The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theory." Bulletin of the Institute of Combinatorics and its Applications "Succeeds dramatically ... a hell of a good book." MAA Reviews "A highlight of the book is what is by far the best account in print of the Seymour-Robertson theory of graph minors." Mathematika " ... like listening to someone explain mathematics." Bulletin of the AMS
Review
From the reviews of the fourth edition: "This is the fourth edition of this interesting graph theory textbook. ... The author marked paragraphs recommended for a first course and also some exercises. At the end of each chapter there are notes for further studying the topic. At the end of the book there are the Appendices ... and also hints for all the exercises. On its 436 pages the book touches upon many research topics in modern graph theory." (Ferdinand Gliviak, Zentralblatt MATH, Vol. 1204, 2011) "This is the fourth edition of this interesting graph theory textbook. ... The author marked paragraphs recommended for a first course and also some exercises. At the end of each chapter there are notes for further studying the topic. At the end of the book there are the Appendices ... and also hints for all the exercises. On its 436 pages the book touches upon many research topics in modern graph theory." (Ferdinand Gliviak, Zentralblatt MATH, Vol. 1204, 2011)
Synopsis
Almosttwodecadeshavepassedsincetheappearanceofthosegrapht- ory texts that still set the agenda for most introductory courses taught today. The canon created by those books has helped to identify some main?eldsofstudyandresearch, andwilldoubtlesscontinuetoin?uence the development of the discipline for some time to come. Yet much has happened in those 20 years, in graph theory no less thanelsewhere: deepnewtheoremshavebeenfound, seeminglydisparate methods and results have become interrelated, entire new branches have arisen. To name just a few such developments, one may think of how the new notion of list colouring has bridged the gulf between inva- ants such as average degree and chromatic number, how probabilistic methods andtheregularity lemmahave pervadedextremalgraphtheory and Ramsey theory, or how the entirely new ?eld of graph minors and tree-decompositions has brought standard methods of surface topology to bear on long-standing algorithmic graph problems. Clearly, then, the time has come for a reappraisal: what are, today, the essential areas, methods and results that should form the centre of an introductory graph theory course aiming to equip its audience for the most likely developments ahead? I have tried in this book to o?er material for such a course. In view of the increasing complexity and maturity of the subject, I have broken with the tradition of attempting to cover both theory and app- cations: this book o?ers an introduction to the theory of graphs as part of (pure) mathematics; it contains neither explicit algorithms nor 'real world' applications.
Synopsis
The fourth edition of this standard textbook of modern graph theory has been revised, updated, and substantially extended. Covering all major recent developments, it can be used both as a reliable textbook for an introductory course and as a graduate text.
About the Author
Reinhard Diestel is Professor at the Department of Mathematics at the University of Hamburg
Table of Contents
The Basics.- Matching Covering and Packing .- Connectivity.- Planar Graphs.- Colouring.- Flows.- Extremal Graph Theory.- Infinite Graphs.- Ramsey Theory for Graphs.- Hamilton Cycles.- Random Graphs.- Minors, Trees and WQO.- A. Infinite sets.- B. Surfaces.