A Simple Criterion for a Graph to have a Perfect Matching

DOI10.1080/02522667.1987.10698893MaRDI QIDQ3762356zbMATH OpenOpenAlexFDO

Authors Fred Glover, Frank Harary

Publication date 1987

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1987.10698893

zbMATH Keywords

1-factorperfect matching

Mathematics Subject Classification ID

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

Recommendations

• A generalization of Tutte's 1-factor theorem to countable graphs
• Matchings in infinite graphs
• scientific article; zbMATH DE number 4112647
• Perfect matching and polymatroids
• A simple a. s. correct algorithm for deciding if a graph has a perfect matching

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs

Cited in

(6)

• Graphs with no \(M\)-alternating path between two vertices
• Tutte type theorems for graphs having a perfect internal matching
• Proof of a theorem of Tutte using permanents
• scientific article; zbMATH DE number 1808637 (Why is no real title available?)
• scientific article; zbMATH DE number 4112647 (Why is no real title available?)
• Generalizing Tutte's theorem and maximal non-matchable graphs

This page was built for publication: A Simple Criterion for a Graph to have a Perfect Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762356)