A coarse block-cut tree theorem

Júlia Baligács, Václav Blažej, Jadwiga Czyżewska +2

We prove a coarse analogue of the classic fact that every graph can be decomposed along its cut-vertices into $2$-connected components. Precisely, we prove that for every graph $G$…