On matching extensions with prescribed and proscribed edge sets. II
From MaRDI portal
Publication:1292810
Recommendations
Cites work
- scientific article; zbMATH DE number 4066957 (Why is no real title available?)
- scientific article; zbMATH DE number 19207 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 1161241 (Why is no real title available?)
- scientific article; zbMATH DE number 874216 (Why is no real title available?)
- Extending matchings in claw-free graphs
- Extending matchings in graphs: A survey
- Graphs with 1-Factors
- Matching theory
- Matchings and matching extensions in graphs
- On n-extendable graphs
- Two results on matching extensions with prescribed and proscribed edge sets
Cited in
(9)- Perfect matchings avoiding several independent edges in a star-free graph
- Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
- Perfect matchings avoiding prescribed edges in a star-free graph
- Toughness, binding number and restricted matching extension in a graph
- Minimal graphs for matching extensions
- The extendability of matchings in strongly regular graphs
- A note on cyclic connectivity and matching properties of regular graphs
- scientific article; zbMATH DE number 434908 (Why is no real title available?)
- Perfect matchings after vertex deletions
This page was built for publication: On matching extensions with prescribed and proscribed edge sets. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292810)
