BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS

DOI10.1142/S1793830910000450zbMath1214.05138OpenAlexW2078159548MaRDI QIDQ3560059

Xiumei Wang, Yanpei Liu, Sujing Zhou

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

matchinggraph theorybipartite matchingtoughness

Mathematics Subject Classification ID

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

Cites Work

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

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