Generalization of matching extensions in graphs. III
From MaRDI portal
Publication:534332
DOI10.1016/j.dam.2010.12.024zbMath1223.05221MaRDI 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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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