2000 character limit reached
Excluding a full grid minor
Published 13 Oct 2015 in math.CO | (1510.03599v2)
Abstract: In this paper we characterise the graphs containing a $\mathbb{Z} \times \mathbb{Z}$ grid minor in a similar way as it has been done by Halin for graphs with an $\mathbb{N} \times \mathbb{Z}$ grid minor. Using our characterisation, we describe the structure of graphs without $\mathbb{Z} \times \mathbb{Z}$ grid minors in terms of tree-decompositions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.