Reconfiguring dominating sets in minor-closed graph classes

Dieter Rautenbach, Johannes Redl

For a graph $G$, two dominating sets $D$ and $D^{\prime }$ in $G$, and a non-negative integer $k$, the set $D$ is said to $k$-transform to $D^{\prime }$ if there is a sequence $D_0,\dots ,D_{\ell }$ of…