BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS

DOI10.1142/S1793830910000450MaRDI QIDQ3560059zbMATH OpenOpenAlexFDO

Authors Xiumei Wang, Sujing Zhou, Yanpei Liu

Publication date 19 May 2010

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830910000450

zbMATH Keywords

bipartite matchinggraph theorymatchingtoughness

Mathematics Subject Classification ID

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

Recommendations

• Bipartite matching extendable graphs
• scientific article; zbMATH DE number 4066957
• Bipartite matching extendability of Harary graphs
• Toughness and matching extension in graphs
• Bipartite matching-extendability of Halin graphs
• scientific article; zbMATH DE number 5850547
• Extendability and criticality in matching theory
• On maximal bipartite matching extendable graphs
• scientific article; zbMATH DE number 5926313
• Binding number, toughness and general matching extendability in graphs

Cites work

• Generalization of matching extensions in graphs
• On k-factor-critical graphs
• On n-extendable graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and matching extension in graphs
• Toughness in graphs -- a survey

Cited in

(8)

• Toughness and matching extension in graphs
• Extendability and criticality in matching theory
• Bipartite matching-extendability of Halin graphs
• scientific article; zbMATH DE number 5850547 (Why is no real title available?)
• 4-regular bipartite matching extendable graphs.
• Toughness and spectral radius in graphs
• Characterizations of spectral radius and toughness of graphs
• Bipartite matching extendable graphs

This page was built for publication: BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS

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