3 papers
math.CO2026
A structural duality for path-decompositions into parts of small radius
Sandra Albrechtsen, Reinhard Diestel, Ann-Kathrin Elm +4
It is an easy observation that if a graph~ admits a path-decomposition whose parts have small radius, then contains no large subdivision of or as a (quasi-)g…
math.CO2025
Canonical graph decompositions via coverings
Reinhard Diestel, Raphael W. Jacobs, Paul Knappe +1
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degre…
math.CO2025
A grid theorem for strong immersions of walls
Reinhard Diestel, Raphael W. Jacobs, Paul Knappe +1
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…