Graph theory / Reinhard Diestel.

Previous ed. published: 2000.

Includes bibliographical references and indexes.

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.

Almost two decades after the appearance of most of the classical texts on the subject, this fresh introduction to Graph Theory offers a reassessment of what are the theory's main fields, methods and results today. Viewed as a branch of pure mathematics, the theory of finite graphs is developed as a coherent subject in its own right, with its own unifying questions and methods. Graph Theory can be used at various different levels. It contains all the standard basic material to be taught in a first undergraduate course, complete with detailed proofs and numerous illustrations. For a graduate course, the book offers proofs of several more advanced results, most of which thus appear in a book for the first time. These proofs are described with as much care and detail as their simpler counterparts. To the professional mathematician, finally, the book affords an overview of graph theory as it stands today: with its typical questions and methods, its classic results, and some of those developments that have made this subject such an exciting area in recent years.