A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Shortest Reconfiguration of Colorings Under Kempe Changes
2020
Symposium on Theoretical Aspects of Computer Science
A k-coloring of a graph maps each vertex of the graph to a color in {1, 2, ..., k}, such that no two adjacent vertices receive the same color. Given a k-coloring of a graph, a Kempe change produces a new k-coloring by swapping the colors in a bicolored connected component. We investigate the complexity of finding the smallest number of Kempe changes needed to transform a given k-coloring into another given k-coloring. We show that this problem admits a polynomial-time dynamic programming
doi:10.4230/lipics.stacs.2020.35
dblp:conf/stacs/BonamyHI0MMSW20
fatcat:kfvdu74mnvdehgbogisfrhueea