Almost two decades after the appearance of most of the classical texts on the theory, this fresh introduction offers a reassessment of the 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, and can be used at various levels. It contains all the standard material for a first undergraduate course, complete with detailed proofs and numerous illustrations. While, for graduates, the text offers proofs of several more advanced results, most of which appear in a book for the first time. These proofs are described with as much care and detail as their simpler counterparts, often with an informal discussion of their underlying ideas complementing their rigorous step-by-step account. Finally, to 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 it such an exciting area in recent years.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Reinhard Diestel is Professor at the Department of Mathematics at the University of Hamburg
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata