Bipartite matching extendable graphs

DOI10.1016/J.DISC.2007.09.053MaRDI QIDQ998414zbMATH OpenOpenAlexFDO

Authors Xiumei Wang, Zhenkun Zhang, Yanpei Liu

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.09.053

zbMATH Keywords

graph theorymatchingbipartite matchingbipartite-matching extendable

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5926313
• scientific article; zbMATH DE number 5850547
• Bipartite matching-extendability of Halin graphs
• scientific article; zbMATH DE number 6746903
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1286491 (Why is no real title available?)
• scientific article; zbMATH DE number 637274 (Why is no real title available?)
• scientific article; zbMATH DE number 1475160 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Graph theory
• Induced matchings
• Matching theory
• Maximal IM-unextendable graphs
• On n-extendable graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Perfect matchings and ears in elementary bipartite graphs
• Plane elementary bipartite graphs

Cited in

(11)

• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• Resilience and optimization of identifiable bipartite graphs
• scientific article; zbMATH DE number 5850547 (Why is no real title available?)
• scientific article; zbMATH DE number 6001476 (Why is no real title available?)
• 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 Halin graphs
• On maximal bipartite matching extendable graphs
• Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• An extendable stable matching algorithm of a kind of bipartite graph

This page was built for publication: Bipartite matching extendable graphs

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