Additive Quasi-isometry via rooted graph partitions and layering partition

Dibyayan Chakraborty, Yann Vaxès

For a graph $H$, $⟨H⟩$ denotes the class of all subdivisions of $H$ and $tw(H)$ denotes the treewidth of $H$. In this paper, we prove the following. For $k\geq 1, R\g…