On matching extensions with prescribed and proscribed edge sets. II

DOI10.1016/S0012-365X(99)90035-3zbMath0929.05068OpenAlexW4246286933MaRDI QIDQ1292810

Michael D. Plummer, R. E. L. Aldred

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

zbMATH Keywords

bipartite graphsperfect matchingclaw-free graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Toughness, binding number and restricted matching extension in a graph ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Minimal graphs for matching extensions ⋮ The extendability of matchings in strongly regular graphs ⋮ Perfect matchings after vertex deletions ⋮ Perfect matchings avoiding prescribed edges in a star-free graph ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph

Cites Work

• Matching theory
• On n-extendable graphs
• Two results on matching extensions with prescribed and proscribed edge sets
• Extending matchings in graphs: A survey
• Extending matchings in claw-free graphs
• Matchings and matching extensions in graphs
• Graphs with 1-Factors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On matching extensions with prescribed and proscribed edge sets. II