This book is a careful and thorough introduction to Graph Theory. It covers all of the central topics in real depth, always giving plenty of motivation. It also contains some fascinating material not normally found in textbooks, such as Fleischner’s theorem that the square of a 2-connected graph is always Hamiltonian. A highlight of the book is the chapter on graph minors, which contains what is by far the best account in print of the Seymour-Robertson proof of Wagner’s Conjecture. It manages to convey the key ideas behind the proof, while at the same time giving enough of the details that the reader gets a feel for the actual methods involved. Not many authors could have accomplished this!

This book is a careful and thorough introduction to Graph Theory. It covers all of the central topics in real depth, always giving plenty of motivation. It also contains some fascinating material not normally found in textbooks, such as Fleischner’s theorem that the square of a 2-connected graph is always Hamiltonian. A highlight of the book is the chapter on graph minors, which contains what is by far the best account in print of the Seymour-Robertson proof of Wagner’s Conjecture. It manages to convey the key ideas behind the proof, while at the same time giving enough of the details that the reader gets a feel for the actual methods involved. Not many authors could have accomplished this!