Perfect matchings in grid graphs after vertex deletions

DOI10.1137/090776706MaRDI QIDQ3225152zbMATH OpenOpenAlexFDO

Authors

Publication date 15 March 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5bc6c23e7526911a8a357e9b6bd019dd4b5817da

zbMATH Keywords

digital spacesgrid graphsisoperimetric inequalitiesmatchings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect matchings after vertex deletions
• Perfect matchings in pruned grid graphs
• Matching preclusion for n-grid graphs
• scientific article; zbMATH DE number 5016662
• Perfect matchings in regular bipartite graphs

Cited in

(3)

• Perfect matchings after vertex deletions
• Removal of subgraphs and perfect matchings in graphs on surfaces
• Perfect matchings in pruned grid graphs

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

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