@InProceedings{osawa_et_al:LIPIcs.ISAAC.2017.62,
author = {Osawa, Hiroki and Suzuki, Akira and Ito, Takehiro and Zhou, Xiao},
title = {{Complexity of Coloring Reconfiguration under Recolorability Constraints}},
booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages = {62:1--62:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-054-5},
ISSN = {1868-8969},
year = {2017},
volume = {92},
editor = {Okamoto, Yoshio and Tokuyama, Takeshi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.62},
URN = {urn:nbn:de:0030-drops-82588},
doi = {10.4230/LIPIcs.ISAAC.2017.62},
annote = {Keywords: combinatorial reconfiguration, graph coloring, PSPACE-complete}
}