Canonical tree-decompositions of finite graphs I. Existence and algorithms
Combinatorics
2014-04-25 v3
Abstract
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the graph.
Keywords
Cite
@article{arxiv.1305.4668,
title = {Canonical tree-decompositions of finite graphs I. Existence and algorithms},
author = {Johannes Carmesin and Reinhard Diestel and Matthias Hamann and Fabian Hundertmark},
journal= {arXiv preprint arXiv:1305.4668},
year = {2014}
}
Comments
23 pages, 5 figures