43 citations · 82 across the 6 of their papers we have counts for
6 papers
Canonical tree-decompositions of finite graphs II. Essential parts
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now es…
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such…
-Blocks: a connectivity invariant for graphs
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
A -block in a graph is a maximal set of at least vertices no two of which can be separated in by fewer than other vertices. The block number of is the…
Profiles of separations: in graphs, matroids and beyond
Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk
We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. Thi…
Connectivity and tree structure in finite graphs
Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark +1
Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions…
A classification of connected-homogeneous digraphs
Matthias Hamann, Fabian Hundertmark
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-t…