Sequentially Swapping Tokens: Further on Graph Classes

Hironori Kiya, Yuto Okada, Hirotaka Ono +1

We study the following variant of the 15 puzzle. Given a graph and two token placements on the vertices, we want to find a walk of the minimum length (if any exists) such that the…