Bipartite matching-extendability of Halin graphs

DOI10.3785/J.ISSN.1008-9497.2009.05.002zbMATH Open1224.05407MaRDI QIDQ3072964FDOQ3072964

Authors: Zhi-hao Hui, Biao Zhao 

Publication date: 5 February 2011

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

zbMATH Keywords

Halin graphbipartite matching

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipartite matching extendable graphs
• Title not available (Why is that?)
• 4-regular bipartite matching extendable graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipartite matching extendability of Harary graphs
• On maximal bipartite matching extendable graphs
• An extendable stable matching algorithm of a kind of bipartite graph
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS

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)