Two results on matching extensions with prescribed and proscribed edge sets

DOI10.1016/S0012-365X(98)00405-1zbMATH Open0981.05083OpenAlexW2036936499MaRDI QIDQ1304803FDOQ1304803

Authors: R. E. L. Aldred, M. I. Porteous, Michael D. Plummer, Derek Holton 

Publication date: 27 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00405-1

Recommendations

• On matching extensions with prescribed and proscribed edge sets. II
• scientific article; zbMATH DE number 874216
• Distance-restricted matching extension in planar triangulations
• scientific article; zbMATH DE number 434908

zbMATH Keywords

bipartite graphsmatchingsclaw-free graphs

Mathematics Subject Classification ID

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

Cited In (10)

• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• \(k\) -factors in regular graphs
• Fractional \(\ell\)-factors in regular graphs
• Distance-restricted matching extension in planar triangulations
• On matching extensions with prescribed and proscribed edge sets. II
• A note on cyclic connectivity and matching properties of regular graphs
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• Toughness, binding number and restricted matching extension in a graph
• Pseudo 2-factor isomorphic regular bipartite graphs
• Removable Edges in Claw-Free Bricks

This page was built for publication: Two results on matching extensions with prescribed and proscribed edge sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304803)