Non-branching tree-decompositions
Combinatorics
2018-04-17 v2 Discrete Mathematics
Abstract
We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequent paper to show that every 2-connected graph of large path-width has a minor isomorphic to either a large tree with a vertex attached to every vertex of the tree or a large outerplanar graph.
Keywords
Cite
@article{arxiv.1712.00653,
title = {Non-branching tree-decompositions},
author = {Thanh N. Dang and Robin Thomas},
journal= {arXiv preprint arXiv:1712.00653},
year = {2018}
}
Comments
The paper has been subsumed into arXiv:1712.04549