A matching in a graph is a subset whose edges have pairwise disjoint endpoints. It is a perfect matching when every vertex is incident to exactly one edge in .

Ancestors (10)

  1. 3
  2. Combinatorial optimisation
  3. 2023
  4. Past exam of the computer science course of the University of Oxford
  5. Computer science course of the University of Oxford
  6. Undergraduate course of the University of Oxford
  7. Course of the University of Oxford
  8. University of Oxford
  9. List of universities
  10. 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