graph theory as i have known it oxford lecture ser
g each vertex exactly once. Kuratowski's Theorem: Characterization of planar graphs via forbidden subgraphs. Brooks' Theorem: Bounds on the chromatic number of a graph based on its maximum degree. Max-Flow Min-Cut