Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777643 | Journal of Combinatorial Theory, Series B | 2017 | 20 Pages |
Abstract
Carmesin et al. proved that every finite graph has a canonical tree-decomposition of adhesion less than k that distinguishes all its k-blocks and tangles of order k. We construct such tree-decompositions with the additional property that every separable k-block is equal to the unique part in which it is contained. This proves a conjecture of Diestel.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Johannes Carmesin, J. Pascal Gollin,