Matching extendability of the cyclic graph C₂n(1, (2n+1)/3)

MaRDI QIDQ2991582zbMATH OpenFDO

Authors Zhi-hao Hui, Houchao Zhang, Biao Zhao

Publication date 10 August 2016

zbMATH Keywords

bipartite matching extendabilitycyclic graphperfect matching

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 6746903
• scientific article; zbMATH DE number 6007655
• scientific article; zbMATH DE number 4066957
• Lower bound of cyclic edge connectivity for n-extendability of regular graphs
• scientific article; zbMATH DE number 5926313

Cited in

(4)

• Bipartite matching extendability of Harary graphs
• scientific article; zbMATH DE number 6007655 (Why is no real title available?)
• Matching extendability in Cartesian products of cycles
• scientific article; zbMATH DE number 6746903 (Why is no real title available?)

This page was built for publication: Matching extendability of the cyclic graph \(C_{2n}(1, (2n+1)/3)\)

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