Discrete Mathematics By Olympia Nicodemi [better] Jun 2026

The chapters on graph theory are particularly strong. Nicodemi avoids the common trap of treating graph theory as a series of algorithms (BFS, DFS, Dijkstra). Instead, she focuses on graph properties : planarity, coloring, and path structure. The combinatorial proofs of graph theorems (e.g., Euler’s formula for planar graphs) are presented with geometric intuition followed by rigorous algebra. A student who works through Nicodemi’s graph theory chapters will understand why a graph is 2-colorable if and only if it is bipartite—not just how to test for bipartiteness.

The text delves into several foundational areas of discrete mathematics: Discrete Mathematics by Olympia Nicodemi