Bounding connected tree-width

Matthias Hamann, Daniel Weißauer

Diestel and Müller showed that the connected tree-width of a graph $G$, i.e., the minimum width of any tree-decomposition with connected parts, can be bounded in terms of the tree-…