OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Matching preclusion

 Home Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Matching (graph theory)
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Matching preclusion is a concept primarily used in the field of graph theory and combinatorial optimization, particularly in the study of matchings in bipartite graphs. The central idea of matching preclusion is to identify and analyze conditions under which certain edges or vertices in a graph can be "excluded" from being part of any maximum matching.

 Ancestors (6)

  1. Matching (graph theory)
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook