Definitions from Wikipedia (Matching preclusion)

▸ noun:  In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion results in the elimination of all perfect matchings or near-perfect matchings (matchings that cover all but one vertex in a graph with an odd number of vertices)..


▸ Words similar to matching preclusion
▸ Usage examples for matching preclusion

▸ Idioms related to matching preclusion
▸ Wikipedia articles (New!)
▸ Words that often appear near matching preclusion
▸ Rhymes of matching preclusion

▸ Invented words related to matching preclusion