Graph Theory37 sections · 1633 units
Open in CourseQuiz: Konig's Theorem
Knowledge check
Check Your Understanding
Konig's theorem says the minimum vertex cover in a bipartite graph equals the maximum matching. If the maximum matching has edges, what is the minimum vertex cover size?
- A.
- B.
- C.
- D.It depends on the graph structure