Matching extension and minimum degree

DOI10.1016/0012-365X(95)00352-WzbMath0876.05078OpenAlexW1973436029MaRDI QIDQ1363649

Louis Caccetta, Nawarat Ananchuen

Publication date: 10 November 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00352-w

zbMATH Keywords

bipartite graphperfect matching\(k\)-extendable graphs

Mathematics Subject Classification ID

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

Related Items (4)

A characterization of maximal non-\(k\)-factor-critical graphs ⋮ Matching extension and distance spectral radius ⋮ Connectivity of \(k\)-extendable graphs with large \(k\). ⋮ Bipartite double cover and perfect 2-matching covered graph with its algorithm

Cites Work

• Minimum degree of bipartite graphs and the existence of k-factors
• Extending subpermutation matrices in regular classes of matrices
• On n-extendable graphs
• On defect-d matchings in graphs
• Extending matchings in graphs: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching extension and minimum degree