Bipartite vertex cover
= Bipartite vertex cover
König's theorem equates the minimum vertex-cover size of a bipartite graph with its maximum matching size.
A bipartite vertex cover is a <vertex cover> restricted to a <bipartite graph>; <Kőnig's theorem for bipartite matching> computes its minimum size.