Graph Theory
Reinhard Diestel(Author)
Springer (Publisher)
Published on 22. May 1997
Book
Hardback
XIV, 286 pages
978-0-387-98210-6 (ISBN)
Article exhausted; check for reprint
Description
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 the theorys 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. The book thus seeks to complement, not replace, the existing more algorithmic treatments of the subject. It may be used at various different levels: it contains all the standard basic material for a first undergraduate course, complete with detailed proofs and numerous illustrations, while for a graduate course, the book offers proofs of several more advanced results. These proofs are described in as much detail as their simpler counterparts, with an informal discussion of their underlying ideas complementing their rigorous step-by-step account. Finally, for the professional mathematician 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.
More details
Series
Language
English
Place of publication
NY
United States
Target group
College/higher education
Professional and scholarly
Illustrations
103
103 s/w Abbildungen
100 figures
Weight
570 gr
ISBN-13
978-0-387-98210-6 (9780387982106)
Schweitzer Classification
Other editions
New editions

Reinhard Diestel
Graph Theory
Book
03/2000
2nd Edition
Springer
€74.85
Article exhausted; check for reprint
Additional editions
Content
Contents: 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.