Canonical tree-decompositions of a graph that display its $k$-blocks

Johannes Carmesin, Pascal Gollin

A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by removing less than $k$ vertices. It is separable if there exists a t…