Bipartite matching-extendability of Halin graphs

DOI10.3785/J.ISSN.1008-9497.2009.05.002MaRDI QIDQ3072964zbMATH OpenFDO

Authors Zhi-hao Hui, Biao Zhao

Publication date 5 February 2011

zbMATH Keywords

Halin graphbipartite matching

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5926313
• Bipartite matching extendable graphs
• scientific article; zbMATH DE number 5850547
• Bipartite matching extendability of Harary graphs
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS

Cited in

(11)

• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• scientific article; zbMATH DE number 5850547 (Why is no real title available?)
• Bipartite matching extendable graphs
• scientific article; zbMATH DE number 6001476 (Why is no real title available?)
• 4-regular bipartite matching extendable graphs.
• scientific article; zbMATH DE number 5926313 (Why is no real title available?)
• scientific article; zbMATH DE number 6746903 (Why is no real title available?)
• Bipartite matching extendability of Harary graphs
• On maximal bipartite matching extendable graphs
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• An extendable stable matching algorithm of a kind of bipartite graph

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

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