Reconfiguration is concerned with relationships among solutions to a problem instance,
where the reconfiguration of one solution to another is a sequence of steps such that each …

Reconfiguring two shortest paths in a graph means modifying one shortest path to the other
by changing one vertex at a time so that all the intermediate paths are also shortest paths …

The reconfiguration graph R k (G) of the k‐colorings of a graph G has as vertex set the set of
all possible k‐colorings of G and two colorings are adjacent if they differ on the color of …

We address the structure of reconfiguration graphs by considering the questions of whether
the classes of shortest path, coloring, and matroid independent set reconfiguration graphs …

The shortest path problem is the most classical and fundamental problem in the field of
graph algorithm. Recently, its reconfiguration variant, namely the Shortest Path …