TY - GEN
T1 - The coloring reconfiguration problem on specific graph classes
AU - Hatanaka, Tatsuhiko
AU - Ito, Takehiro
AU - Zhou, Xiao
N1 - Funding Information:
This work is partially supported by JST CREST Grant Number JPMJCR1402, and by JSPS KAKENHI Grant Numbers JP16J02175, JP16K00003, and JP16K00004, Japan.
PY - 2017
Y1 - 2017
N2 - We study the problem of transforming one (vertex) k-coloring 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 denotes the number of colors. This decision problem is known to be PSPACE-complete even for bipartite graphs and any fixed constant k≥4. In this paper, we study the problem from the viewpoint of graph classes. We first show that the problem remains PSPACE-complete for chordal graphs even if the number of colors is a fixed constant. We then demonstrate that, even when the number of colors is a part of input, the problem is solvable in polynomial time for several graph classes, such as split graphs and trivially perfect graphs.
AB - We study the problem of transforming one (vertex) k-coloring 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 denotes the number of colors. This decision problem is known to be PSPACE-complete even for bipartite graphs and any fixed constant k≥4. In this paper, we study the problem from the viewpoint of graph classes. We first show that the problem remains PSPACE-complete for chordal graphs even if the number of colors is a fixed constant. We then demonstrate that, even when the number of colors is a part of input, the problem is solvable in polynomial time for several graph classes, such as split graphs and trivially perfect graphs.
UR - http://www.scopus.com/inward/record.url?scp=85038212953&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85038212953&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-71150-8_15
DO - 10.1007/978-3-319-71150-8_15
M3 - Conference contribution
AN - SCOPUS:85038212953
SN - 9783319711492
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 152
EP - 162
BT - Combinatorial Optimization and Applications - 11th International Conference, COCOA 2017, Proceedings
A2 - Han, Meng
A2 - Du, Hongwei
A2 - Gao, Xiaofeng
PB - Springer Verlag
T2 - 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017
Y2 - 16 December 2017 through 18 December 2017
ER -