On matching extensions with prescribed and proscribed edge sets. II
From MaRDI portal
Publication:1292810
DOI10.1016/S0012-365X(99)90035-3zbMATH Open0929.05068OpenAlexW4246286933MaRDI QIDQ1292810FDOQ1292810
Authors: R. E. L. Aldred, Michael D. Plummer 
Publication date: 25 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90035-3
Recommendations
Cites Work
- Matching theory
- On n-extendable graphs
- Title not available (Why is that?)
- Extending matchings in graphs: A survey
- Graphs with 1-Factors
- Title not available (Why is that?)
- Matchings and matching extensions in graphs
- Title not available (Why is that?)
- Extending matchings in claw-free graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two results on matching extensions with prescribed and proscribed edge sets
Cited In (9)
- The extendability of matchings in strongly regular graphs
- Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
- Perfect matchings after vertex deletions
- A note on cyclic connectivity and matching properties of regular graphs
- Toughness, binding number and restricted matching extension in a graph
- Perfect matchings avoiding prescribed edges in a star-free graph
- Minimal graphs for matching extensions
- Title not available (Why is that?)
- Perfect matchings avoiding several independent edges in a star-free graph
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)
