The ultimate categorical matching in a graph

DOI10.1016/S0012-365X(00)00181-3zbMATH Open0971.05090OpenAlexW1998044937MaRDI QIDQ5937440

Richard J. Nowakowski, Michael H. Albert, Derek Holton

Publication date: 21 October 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00181-3

zbMATH Keywords

bipartite graphultimate categorial matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Matchings and matching extensions in graphs 👍 👎
• Graphical condensation for enumerating perfect matchings 👍 👎
• A note on the ultimate categorical matching in a graph 👍 👎
• The graph matching problem 👍 👎
• On matchings in graphs 👍 👎
• Matching graphs 👍 👎
• Exact Perfect Matching in Complete Graphs 👍 👎

This page was built for publication: The ultimate categorical matching in a graph