Matchings and matching extensions in graphs
From MaRDI portal
Publication:1584277
DOI10.1016/S0012-365X(97)00182-9zbMath0958.05108MaRDI QIDQ1584277
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (6)
The extendability of matchings in strongly regular graphs ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ Perfect matchings avoiding prescribed edges in a star-free graph ⋮ Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph ⋮ On matching extensions with prescribed and proscribed edge sets. II ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On n-extendable graphs
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
- Factors in graphs with odd-cycle property
- Extending matchings in graphs: A survey
- Extending matchings in claw-free graphs
- Toughness and matching extension in graphs
- Binding number and toughness for matching extension
- 1-Factors and Antifactor Sets
- Some Properties of Graphs with Multiple Edges
- The Factors of Graphs
This page was built for publication: Matchings and matching extensions in graphs
