7 citations · 14 across the 14 of their papers we have counts for
5 papers · 2 filters
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…
Menger's Theorem in bidirected graphs
Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set…
A Menger-type theorem for two induced paths
Sandra Albrechtsen, Tony Huynh, Raphael W. Jacobs +2
We give an approximate Menger-type theorem for when a graph contains two paths and such that is an induced subgraph of . More generally, we…
Efficiently distinguishing all tangles in locally finite graphs
Raphael W. Jacobs, Paul Knappe
While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show t…
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…