Which graph has a size of minimum vertex cover equal to maximum matching?
(a) Cartesian
(b) Tree
(c) Heap
(d) Bipartite
I have been asked this question at a job interview.
The origin of the question is Bipartite Graphs in division Bipartite Graphs of Data Structures & Algorithms II