Norman L. Biggs Discrete Mathematics Pdf 2021 -

Most readers agree: Biggs’ treatment of graph theory is worth the price of admission alone. He covers Eulerian and Hamiltonian paths, planar graphs, and graph coloring (including the famous four-color theorem). For computer science students, the sections on trees (spanning trees, rooted trees, binary search trees) are directly applicable to data structures.

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.” norman l. biggs discrete mathematics pdf