A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens

Nived J. M., Mathew C. Francis

We consider the problem of shifting two tokens placed on nonadjacent vertices $u,v$ of a graph $G$ on $n$ vertices to two nonadjacent vertices $u^{\prime },v^{\prime }$ of $G$ using a sequence of to…