4 citations · 7 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 4 cited
Canonical tree-decompositions of finite graphs II. Essential parts
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
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 es…
math.CO2013★ 3 cited
Canonical tree-decompositions of finite graphs I. Existence and algorithms
Johannes Carmesin, Reinhard Diestel, Matthias Hamann +1
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…