Generalization of matching extensions in graphs. III

DOI10.1016/j.dam.2010.12.024zbMath1223.05221OpenAlexW4210439484MaRDI QIDQ534332

Hongliang Lu, Qinglin Yu, Bing Bai

Publication date: 17 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.024

zbMATH Keywords

\((n\(k\)-extendable graphs\(n\)-factor-critical graphsk, d)\)-graphs

Mathematics Subject Classification ID

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

Related Items (2)

Minimal graphs for 2-factor extension ⋮ Minimal graphs for matching extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of maximal non-\(k\)-factor-critical graphs
• On n-extendable graphs
• Generalization of matching extensions in graphs. II.
• On k-factor-critical graphs
• On (n,k)-extendable graphs and induced subgraphs
• Generalization of matching extensions in graphs

This page was built for publication: Generalization of matching extensions in graphs. III