Grid minors in damaged grids (Q405308): Difference between revisions
From MaRDI portal
Latest revision as of 23:51, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grid minors in damaged grids |
scientific article |
Statements
Grid minors in damaged grids (English)
0 references
4 September 2014
0 references
Summary: We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds are tight to within constant factors. We also provide less-tight bounds on analogous problems for higher-dimensional grids.
0 references
grid graphs
0 references
graph minors
0 references
subgraphs
0 references
shallow minors
0 references
treewidth
0 references
vertex deletion
0 references
