Topic: Bipartite Graphs and Konig's Theorem

Integrated Matching, Cover, and Independent-Set Problems

Independent Sets as Complements of Vertex Covers

Constructing a Minimum Cover by Alternating Reachability

Common Errors in Bipartite Matching Arguments

Bipartite Graphs and Explicit Bipartitions

Berge’s Theorem on Augmenting Paths

Augmenting Paths and the Edge-Flipping Operation

Alternating Paths and Cycles