Given Biggs’ background, the chapters on graph theory (paths, circuits, trees, planar graphs) are superior to most competitors. If you are studying computer science or network analysis, his treatment of Eulerian and Hamiltonian paths is a masterclass in clarity.
A bibliometric search (Google Scholar, 2023) shows that Biggs’s Discrete Mathematics has been cited in over 3,000 scholarly works, ranging from introductory programming textbooks to advanced research in combinatorial optimization. The text’s influence is especially evident in curricula that emphasize foundations of computer science—for example, the ACM’s Computing Curricula Guidelines (CCG) list it as a recommended source for “Discrete Structures.”
When accessed legally, the PDF version can be integrated into blended‑learning environments: norman l. biggs discrete mathematics pdf
Thus, the PDF is not merely a convenience; it can become a catalyst for innovative instructional design.
The Internet Archive (archive.org) often has a copy of the 2002 edition available for 1-hour loans. You must create a free account, and the book is scanned, but it is legal and free. Given Biggs’ background, the chapters on graph theory
Subsequent textbooks—such as Discrete Mathematics and Its Applications by Kenneth Rosen and Concrete Mathematics by Graham, Knuth, and Patashnik—have built upon the pedagogical foundation that Biggs established. While these later works expand in breadth or adopt a more algorithmic slant, they retain the core principle championed by Biggs: the seamless integration of rigorous proof with real‑world applications.
Before the 1980s, the mathematical training of a computer scientist was predominantly rooted in calculus and linear algebra. Norman L. Biggs, a distinguished professor at the London School of Economics (LSE), recognized a fundamental mismatch. Computer science, he argued, was not the continuous mathematics of Newton, but the discrete mathematics of Leibniz: logic, graphs, trees, and finite sets. Thus, the PDF is not merely a convenience;
Published by Oxford University Press, Discrete Mathematics (revised in 2002) was Biggs’ answer. The book intentionally breaks from the dry, theorem-proof-corollary format. Instead, it is structured around the specific needs of a programmer or algorithm designer.