| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650371 | Discrete Mathematics | 2008 | 6 Pages |
Abstract
We determine conditions sufficient to guarantee the existence of a perfect matching when vertices are removed from finite and infinite grid graphs. The conditions impose a minimum distance between the vertices that are removed. While the distances are likely not best possible, they are best possible with respect to asymptotic growth rate.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David R. Guichard,