43 citations · 82 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 20 cited
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…
math.CO2011★ 43 cited
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…