Vertex identification to a forest

Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos

Let $\mathcal{H}$ be a graph class and $k\in \mathbb{N}$. We say a graph $G$ admits a \emph{$k$-identification to $\mathcal{H}$} if there is a partition $\mathcal{P}$ of some set $X…