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.

This standard textbook of modern graph theory, now in its fifth 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

Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has *
*

depth and integrity. Persi Diaconis & Ron Graham, SIAM Review

The book hasreceived 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

Standard textbook of modern graph theory Covers all the basic material in full detail Introduces and illustrates the more advanced methods of that field

Autorentext
Reinhard Diestel is Professor at the Department of Mathematics at the University of Hamburg.

Inhalt
The Basics.- Matching Covering and Packing.- Connectivity.- Planar Graphs.- Colouring.- Flows.- Extremal Graph Theory.- Infinite Graphs.- Ramsey Theory for Graphs.- Hamilton Cycles.- Random Graphs.- Graph Minors.