bn:26150774n
Noun Concept
PT
No term available
EN
In graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. Wikipedia
Relations
Sources