Perfect matchings in pruned grid graphs

DOI10.1016/J.DISC.2007.11.032MaRDI QIDQ998394zbMATH OpenOpenAlexFDO

Authors 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-factorgrid graphperfect matching

Mathematics Subject Classification ID

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

Recommendations

• Perfect matchings in grid graphs after vertex deletions
• Perfect matchings after vertex deletions
• scientific article; zbMATH DE number 4112647
• Matching preclusion for n-grid graphs
• Existence of perfect matchings in a plane bipartite graph

Cites work

• Perfect matchings after vertex deletions

Cited in

(10)

• Matching preclusion for n-grid graphs
• Perfect matchings of cellular graphs
• Strong matching preclusion under the conditional fault model
• Fractional matching preclusion of the restricted HL-graphs
• Perfect matchings of trimmed Aztec rectangles
• Strong matching preclusion for \(k\)-ary \(n\)-cubes
• Perfect matchings after vertex deletions
• Perfect matchings in grid graphs after vertex deletions
• Strong matching preclusion for torus networks
• Strong matching preclusion

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

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