In graphs, perfect matching refers to the phenomenon of finding a matching that covers all vertices of the graph.