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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. Diestel, Graph Theory, fourth ed., Springer-Verlag, 2012
R. Diestel, Locally finite graphs with ends: a topological approach, arXiv:0912.4213v3 (2012)
Diestel, R.: A short proof of Halin’s grid theorem. Abh. Math. Sem. Univ. Hamburg 74, 137–242 (2004)
Halin, R.: Über die Maximalzahl fremder unendlicher Wege. Math. Nachr. 30, 63–85 (1965)
Halin, R.: Simplicial decompositions of infinite graphs. Ann. Discrete Math. 3, 93–109 (1978)
N. Robertson, P.D. Seymour and R. Thomas, Excluding infinite clique minors, Memoirs Amer. Math. Soc. 118, no. 566 (1995) vi+103 pp
Stein, M.: Extremal infinite graph theory. Discrete Math. 311, 1472–1496 (2011)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Heuer, K. Excluding a full grid minor. Abh. Math. Semin. Univ. Hambg. 87, 265–274 (2017). https://doi.org/10.1007/s12188-016-0165-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12188-016-0165-y