54 citations · 280 across the 32 of their papers we have counts for
37 papers
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…
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…
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…
Duality and tangles of set separations
Reinhard Diestel, Christian Elbracht, Joshua Erde +1
Applications of tangles of connectivity systems suggest a duality between these, in which for two sets and the elements of map to subsets of , and the…
Point sets and functions inducing tangles of set separations
Reinhard Diestel, Christian Elbracht, Raphael W. Jacobs
Tangles, as introduced by Robertson and Seymour, were designed as an indirect way of capturing clusters in graphs and matroids. They have since been shown to capture clusters in mu…
Homological aspects of oriented hypergraphs
Reinhard Diestel
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we defin…