@inproceedings{b9475b7d6ec1407ca08deb9bf9f98d00,
title = "Algorithms for coloring reconfiguration under recolorability digraphs",
abstract = "In the k-Recoloring problem, we are given two (vertex-)colorings of a graph using k colors, and asked to transform one into the other by recoloring only one vertex at a time, while at all times maintaining a proper k-coloring. This problem is known to be solvable in polynomial time if k ≤ 3, and is PSPACE-complete if k ≥ 4. In this paper, we consider a (directed) recolorability constraint on the k colors, which forbids some pairs of colors to be recolored directly. The recolorability constraint is given in terms of a digraph →R, whose vertices correspond to the colors and whose arcs represent the pairs of colors that can be recolored directly. We provide algorithms for the problem based on the structure of recolorability constraints →R, showing that the problem is solvable in linear time when →R is a directed cycle or is in a class of multitrees.",
keywords = "combinatorial reconfiguration, graph coloring, recolorability, recoloring",
author = "Soichiro Fujii and Yuni Iwamasa and Kei Kimura and Akira Suzuki",
note = "Copyright {\textcopyright} Soichiro Fujii, Yuni Iwamasa, Kei Kimura, and Akira Suzuki. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.; 33rd International Symposium on Algorithms and Computation, ISAAC 2022 ; Conference date: 19-12-2022 Through 21-12-2022",
year = "2022",
month = dec,
day = "1",
doi = "10.4230/LIPIcs.ISAAC.2022.4",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Dagstuhl Publishing",
pages = "4:1–4:19",
editor = "Bae, {Sang Won} and Heejin Park",
booktitle = "ISAAC 2022",
address = "Germany",
}