Let G be a graph such that each vertex has its list of available colors, and assume that each list is a subset of the common set consisting of k colors. For two given list colorings of G, we studyâ€¦ (More)

We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only one vertex color assignment at a time, while at all times maintaining a listâ€¦ (More)

We study the problem of transforming one (vertex) kcoloring of a graph into another one by changing only one vertex color assignment at a time, while at all times maintaining a k-coloring, where kâ€¦ (More)