Which theorem gives the relation between the minimum vertex cover and maximum matching?
(a) Konig’s Theorem
(b) Kirchhoff’s Theorem
(c) Kuratowski’s Theorem
(d) Kelmans Theorem
This question was posed to me in exam.
Asked question is from Bipartite Graphs in division Bipartite Graphs of Data Structures & Algorithms II