The Complexity of (List) Edge-Coloring Reconfiguration Problem

Hiroki Osawa, Akira Suzuki, Takehiro Ito +1

Let $G$ be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of $k$ colors. Suppose that we are given…