Every connected graph has a tree-decomposition with bounded-diameter adhesion sets and coarsely inseparable bags, yielding a metric analogue of the block-cutvertex tree.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A coarse block-cutvertex tree-decomposition
Every connected graph has a tree-decomposition with bounded-diameter adhesion sets and coarsely inseparable bags, yielding a metric analogue of the block-cutvertex tree.