Bipartite matching extendability of Harary graphs

zbMATH Open1213.05214MaRDI QIDQ3074352FDOQ3074352

Authors Zhi-hao Hui, Jian-Min Li

Publication date 8 February 2011

zbMATH Keywords

perfect matchingHarary graphbipartite matchingbipartite matching extendable

Mathematics Subject Classification ID

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

Recommendations

• Bipartite matching-extendability of Halin graphs
• scientific article; zbMATH DE number 4066957
• scientific article; zbMATH DE number 6746903
• scientific article; zbMATH DE number 5926313
• Matching extendability of the cyclic graph \(C_{2n}(1, (2n+1)/3)\)

Cited in

(5)

• Bipartite matching-extendability of Halin graphs
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• scientific article; zbMATH DE number 6746903 (Why is no real title available?)
• scientific article; zbMATH DE number 5926313 (Why is no real title available?)

This page was built for publication: Bipartite matching extendability of Harary graphs

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