A matching that matches all the vertices of a graph is called?
(a) Perfect matching
(b) Cardinality matching
(c) Good matching
(d) Simplex matching
The question was posed to me in an interview for job.
This intriguing question comes from Matching topic in division Matching of Data Structures & Algorithms II