A grid theorem for strong immersions of walls

Authors Reinhard Diestel, Raphael W. Jacobs, Paul Knappe, Paul Wollan

Publication date 12 January 2023

Connectivity (05C40) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Abstract: We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small `width', which is measured in terms of its adhesion and the path-likeness of its torsos.

This page was built for publication: A grid theorem for strong immersions of walls

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