Perfect matchings after vertex deletions

DOI10.1016/j.disc.2007.03.017zbMath1126.05077OpenAlexW1981737915MaRDI QIDQ2462373

Stephen C. Locke, Richard P. Anstee, R. E. L. Aldred

Publication date: 30 November 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.017

zbMATH Keywords

matchingsgrid graphvertex deletionbipartite matchingslattice graph

Mathematics Subject Classification ID

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

Related Items (7)

Construction of k-matchings in graph products ⋮ Strong matching preclusion for torus networks ⋮ Strong matching preclusion under the conditional fault model ⋮ Strong matching preclusion for \(k\)-ary \(n\)-cubes ⋮ Strong matching preclusion ⋮ Fractional matching preclusion of the restricted HL-graphs ⋮ Perfect matchings in pruned grid graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• On n-extendable graphs
• On matching extensions with prescribed and proscribed edge sets. II
• On Representatives of Subsets
• The Factorization of Linear Graphs

This page was built for publication: Perfect matchings after vertex deletions