Refining tree-decompositions so that they display the k-blocks

Sandra Albrechtsen

Carmesin and Gollin proved that every finite graph has a canonical tree-decomposition $(T,\mathcal{V})$ of adhesion less than $k$ that efficiently distinguishes every two distinct…