Generalization of matching extensions in graphs. III

DOI10.1016/J.DAM.2010.12.024zbMATH Open1223.05221OpenAlexW4210439484MaRDI QIDQ534332FDOQ534332

Authors: Bing Bai, Hongliang Lu, Qinglin Roger Yu 

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

Recommendations

• Generalization of matching extensions in graphs. II.
• Generalization of matching extensions in graphs
• Matchings and matching extensions in graphs
• Extending matchings in odd graphs
• Generalization of matching extensions in graphs. IV: Closures

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)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• On n-extendable graphs
• Generalization of matching extensions in graphs. II.
• On \(k\)-factor-critical graphs
• Title not available (Why is that?)
• Generalization of matching extensions in graphs
• Title not available (Why is that?)
• On (n,k)-extendable graphs and induced subgraphs
• A characterization of maximal non-\(k\)-factor-critical graphs

Cited In (10)

• Generalization of matching extensions in graphs. II.
• Extending matchings in odd graphs
• The matching extension problem in general graphs is co-NP-complete
• Matching extension and the genus of a graph
• Title not available (Why is that?)
• Minimal graphs for 2-factor extension
• Generalization of matching extensions in graphs. IV: Closures
• Generalization of matching extensions in graphs
• Minimal graphs for matching extensions
• On three extensions of equimatchable graphs

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

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