Vertex Cover Reconfiguration and Beyond

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman +1

In the Vertex Cover Reconfiguration (VCR) problem, given a graph $G$, positive integers $k$ and $\ell$ and two vertex covers $S$ and $T$ of $G$ of size at most $k$, we determine wh…