Perfect matchings in pruned grid graphs

DOI10.1016/j.disc.2007.11.032zbMath1214.05121OpenAlexW1985372570MaRDI QIDQ998394

David R. Guichard

Publication date: 28 January 2009

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

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

zbMATH Keywords

1-factorperfect matchinggrid graph

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• Perfect matchings after vertex deletions

This page was built for publication: Perfect matchings in pruned grid graphs