Graph-Theory

Finding Every Smallest C6-Saturated Graph

An eleven-vertex witness, 205 minimum graphs on fourteen vertices, and the difference between finding an example and proving a minimum.

Semirings: One Algorithm, Six Graph Problems

A semiring has two monoidal operations linked by distributivity. Matrix multiplication over different semirings gives shortest paths, longest paths, widest paths, reachability, and path counting, all from the same code.

A Course in Combinatorics

Algorithm Design

Graph Theory