What do you think?
Rate this book
Graduate Texts in Mathematics #244
Graph Theory
The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory.
675 pages, Hardcover
First published August 14, 2007
14 people are currently reading
120 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 3 of 3 reviews
June 13, 2017
This is the best graph theory book at graduate level. It's unitary, it has fluent, articulate proofs which makes it easy to read. The authors have a great pedagogical sense on how to present a math concept. The book underlines proof techniques and makes a point on how to clearly prove something. Nothing pretentious, just good old-fashioned mathematics at work. The book presents quite a few new(er) results in the field and has comprehensive recommendations at the end of each chapters.
This edition is a lot more comprehensive than the first edition and it is more difficult.
This edition is a lot more comprehensive than the first edition and it is more difficult.
May 5, 2017
The best graph theory book I have seen thus far, and the only one I have seen where the subject feels connected rather than a collection of scattered results around a common theme. There are several choices the authors made that I believe help with this overall feeling of unity to the subject:
1. Introducing Ford-Fulkerson early and recalling it with future instantiations of the theorem (i.e. Menger's theorem, Edmonds' branching theorem, etc.).
2. The highly useful insets that show how the theory of combinatorics is largely built around methods and strategies, rather than algebraic theory.
3. Discussing chromatic polynomial, flow polynomial, and Tutte polynomials, which identify common patterns for graph invariants.
1. Introducing Ford-Fulkerson early and recalling it with future instantiations of the theorem (i.e. Menger's theorem, Edmonds' branching theorem, etc.).
2. The highly useful insets that show how the theory of combinatorics is largely built around methods and strategies, rather than algebraic theory.
3. Discussing chromatic polynomial, flow polynomial, and Tutte polynomials, which identify common patterns for graph invariants.
April 12, 2018
This book represents a very good introduction to what is a fascinating branch of mathematics. The topics included represent all the "big" areas in graph theory. The discourse is just enough to whet the appetite for more advanced study, while remaining very accessible.
Displaying 1 - 3 of 3 reviews