Canonical tree-decompositions of finite graphs II. Essential parts
Combinatorics
2014-04-25 v2
Abstract
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these decompositions that contain no such block or tangle, and determine conditions under which such parts contain nothing but a k-block.
Cite
@article{arxiv.1305.4909,
title = {Canonical tree-decompositions of finite graphs II. Essential parts},
author = {Johannes Carmesin and Reinhard Diestel and Matthias Hamann and Fabian Hundertmark},
journal= {arXiv preprint arXiv:1305.4909},
year = {2014}
}
Comments
15 pages, 3 figures