Douglas B. West’s Introduction to Graph Theory (2001) is widely regarded as one of the most comprehensive and rigorous entry points into the field of discrete mathematics. First published in 1996 and revised for its second edition in 2001, the text balances theoretical depth with algorithmic foundations, making it a standard choice for both undergraduate and beginning graduate courses. Structural and Pedagogical Depth
The book is structured into eight core chapters, supplemented by extensive appendices. West adopts a "proof-centric" approach, emphasizing the construction and understanding of mathematical arguments over mere computation. Foundation (Chapters 1–2):
Introduces fundamental concepts such as paths, cycles, trails, and the specific structural properties of trees and distance. Core Theory (Chapters 3–7):
Covers essential topics including matchings, connectivity (Menger’s Theorem), graph coloring, planarity, and Hamiltonian cycles. Advanced Exploration (Chapter 8): introduction to graph theory by douglas b west pdf
Offers elective topics such as Ramsey Theory, extremal graph theory, and random graphs, providing a bridge to contemporary research. Key Characteristics One of the text's most cited strengths is its vast exercise bank
, containing over 1,200 problems that range from basic applications to challenging proofs. West purposefully postpones complex terminology until it is needed for specific results, a pedagogical choice intended to prevent "definition fatigue" among students.
While the book is praised for its clarity and rigor, some reviewers note that its density can be daunting for students without a strong background in proof-writing. To mitigate this, the second edition includes an expanded appendix on mathematical background (Appendix A) to help beginners navigate sets, functions, and logic. Educational and Research Significance West’s work is distinguished by its inclusion of constructive proofs Douglas B
—proofs that not only state a property exists but also provide a method (or algorithm) to find it. This makes the text valuable for computer science students interested in the "why" behind the "how" of algorithms. Furthermore, West maintains a list of corrections and errata
on his official University of Illinois website, ensuring the material remains accurate for self-study.
Introduction to Graph Theory : Douglas B. West - Internet Archive 26 Nov 2022 — Chapter 3: Trees The most successful selling point
Introduction to Graph Theory : Douglas B. West : Free Download, Borrow, and Streaming : Internet Archive. Internet Archive Introduction to Graph Theory, 2/e by Douglas B. West
The most successful selling point of West’s book is its treatment of trees. He covers characterizations of trees (acyclic but connected), spanning trees, and minimum spanning tree algorithms (Kruskal and Prim). The chapter culminates in Cayley’s formula for the number of labeled trees, proven via Prüfer codes—a beautiful combinatorial bijection.
Before discussing the PDF, one must understand the book's standing. There are dozens of introductory graph theory texts—Bollobás, Diestel, Bondy & Murty. However, West’s book occupies a unique niche:
| Resource | Type | Cost | |----------|------|------| | Graph Theory by Reinhard Diestel (free PDF on author’s site) | Full textbook | Free | | Introduction to Graph Theory by Robin J. Wilson | Concise intro | ~$20 used | | Algorithmic Graph Theory by David Joyner (free online) | More applied | Free | | MIT OpenCourseWare 6.042J (graph theory lectures + notes) | Course materials | Free | | Douglas West’s own errata & exercise hints (on his UIUC website) | Study aid | Free |
Graph coloring is the most accessible deep problem in graph theory (thanks to the Four Color Theorem). West walks the reader through vertex coloring, greedy algorithms, Brooks’ Theorem, and edge coloring (Vizing’s Theorem). He also touches on list coloring, a topic rare in introductory texts but crucial for modern research.