## Graph TheoryThis book is a concise, yet carefully written, introduction to modern graph theory, covering all its major recent developments. It can be used both as a reliable textbook for an introductory course and as a graduate text: on each topic it covers all the basic material in full detail, and adds one or two deeper results (again with detailed proofs) to illustrate the more advanced methods of that field.This second edition extends the first in two ways. It offers a thoroughly revised and updated chapter on graph minors, which now includes full new proofs of two of the central Robertson-Seymour theorems (as well as a detailed sketch of the entire proof of their celebrated Graph Minor Theorem). Second, there is now a section of hints for all the exercises, to enhance their value for both individual study and classroom use. |

### What people are saying - Write a review

#### Review: Graph Theory

User Review - dead letter office - Goodreadsif you want to know more graph theory than you can get from this book, you probably don't need me to tell you where to look. surprisingly readable, and it doesn't assume much prior knowledge. beats the crap out of bollobas. now available free online. http://diestel-graph-theory.com/GrTh.... Read full review

### Common terms and phrases

1-factor 3-connected A-B paths Algebraic algorithm assertion assume that G average degree bijection bipartite graph Chapter chromatic number combinatorial complete graph connected graph consider construct contradiction Corollary cubic graph cycle in G cycle space define denote disjoint e-regular edge of G edge set edge-maximal embedding exists face of G fc-flow finite flow four colour theorem G contains G e Q(n,p given graph graph contains graph G graph minor graph theory Hadwiger's conjecture Hamilton cycle hence implies independent induced subgraph induction hypothesis infinite integer isomorphism least Let G marriage theorem maximal Menger's theorem minimal minimum degree minor theorem multigraph neighbours number of edges pair path in G perfect graph planar plane graph proof of Theorem Proposition Ramsey number Ramsey's theorem random graph regularity lemma satisfies sequence spanning trees subgraph of G subset topological minor tree-decomposition tree-width Tutte's vertex set vertices well-quasi-ordered