54 citations · 280 across the 32 of their papers we have counts for
3 papers · 1 filter
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…
Dual trees must share their ends
Reinhard Diestel, Julian Pott
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. Th…
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…