Minimal graphs for matching extensions
From MaRDI portal
Publication:1686047
DOI10.1016/j.dam.2015.11.007zbMath1376.05118OpenAlexW2183353618MaRDI QIDQ1686047
Dominique de Werra, Marie-Christine Costa, Christophe Picouleau
Publication date: 20 December 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.11.007
Related Items (4)
Hamiltonian extendable graphs ⋮ Minimal graphs for 2-factor extension ⋮ On two extensions of equimatchable graphs ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The extendability of matchings in strongly regular graphs
- Generalization of matching extensions in graphs. III
- Matching theory
- On matching extensions with prescribed and proscribed edge sets. II
- Extending matchings in graphs: A survey
- Toughness and matching extension in graphs
- Generalization of matching extensions in graphs. II.
- Generalization of matching extensions in graphs
This page was built for publication: Minimal graphs for matching extensions
