Search
Now showing items 1-1 of 1
A short proof that every finite graph has a tree-decomposition displaying its tangles
(ElsevierEuropean Journal of Combinatorics, 2016-06-08)
We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles.
This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and ...