On tree decompositions whose trees are minors

Pablo Blanco, Linda Cook, Meike Hatzel +3

In 2019, Dvořák asked whether every connected graph $G$ has a tree decomposition $(T,\mathcal{B})$ so that $T$ is a subgraph of $G$ and the width of $(T,\mathcal{B})$ is bounded…