KnowraMatching (graph theory)Linked fromLinked fromThe 19 pages that link to Matching (graph theory), each with the reason it gives.All 19Broader topic 2Related 10Narrower topic 7Perfect matchingNarrower topic: A perfect matching is a matching that covers every vertex.Blossom algorithmNarrower topic: The algorithm enlarges a matching until no larger one exists.Matching polynomialNarrower topic: Each coefficient counts matchings of a particular size.Maximum-cardinality matchingNarrower topic: A maximum-cardinality matching is a matching chosen to maximize the number of its edges.Hosoya indexNarrower topic: The Hosoya index counts every matching, from the empty set to the largest ones.Stable matching problemNarrower topic: Stable matching adds a preference-based condition to this basic assignment structure.Tutte's theorem on perfect matchingsNarrower topic: A perfect matching is a matching that covers every vertex.