2016/05/19 by Ben Clark, Clark, Ben
Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems #Complexity and Algorithms in Graphs
paper · pdf · doi:10.48550/arxiv.1605.06139
We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle T that satisfies an additional robustness condition, displays all of the non-trivial separations relative to T, up to a natural equivalence.