Two results on matching extensions with prescribed and proscribed edge sets

DOI10.1016/S0012-365X(98)00405-1zbMath0981.05083OpenAlexW2036936499MaRDI QIDQ1304803

M. I. Porteous, R. E. L. Aldred, 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

zbMATH Keywords

bipartite graphsmatchingsclaw-free graphs

Mathematics Subject Classification ID

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

Related Items (9)

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

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