“…As this definition suggests, for a given search problem there might be more than one way to define an edge relation of the reconfiguration graph. Reconfiguration graphs have not only been studied for coloring, but also for many other problems, including Boolean satisfiability [, , ], clique and vertex cover , independent set [, , ], list edge coloring [, ], L (2, 1)‐labeling , shortest path [, ], and subset sum ; see also a recent survey . Typical questions are as follows: is the reconfiguration graph connected; if so what is its diameter; if not what is the diameter of its (connected) components; and how difficult is it to decide whether there is a path between a pair of given solutions?…”