TY - JOUR

T1 - The list coloring reconfiguration problem for bounded pathwidth graphs

AU - Hatanaka, Tatsuhiko

AU - Ito, Takehiro

AU - Zhou, Xiao

N1 - Funding Information:
We are grateful to Daichi Fukase and Yuma Tamura for fruitful discussions with them. This work is partially supported by JSPS KAKENHI Grant Numbers 25106504 and 25330003.
Publisher Copyright:
© Springer International Publishing Switzerland 2014

PY - 2014

Y1 - 2014

N2 - 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 coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it can be extended for threshold graphs. In contrast, we give a polynomial-time algorithm to solve the problem for graphs with pathwidth one. Thus, this paper gives precise analyses of the problem with respect to pathwidth.

AB - 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 coloring, given a list of allowed colors for each vertex. This problem is known to be PSPACE-complete for bipartite planar graphs. In this paper, we first show that the problem remains PSPACE-complete even for bipartite series-parallel graphs, which form a proper subclass of bipartite planar graphs. We note that our reduction indeed shows the PSPACE-completeness for graphs with pathwidth two, and it can be extended for threshold graphs. In contrast, we give a polynomial-time algorithm to solve the problem for graphs with pathwidth one. Thus, this paper gives precise analyses of the problem with respect to pathwidth.

UR - http://www.scopus.com/inward/record.url?scp=84921372078&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84921372078&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-12691-3_24

DO - 10.1007/978-3-319-12691-3_24

M3 - Article

AN - SCOPUS:84921372078

VL - 8881

SP - 314

EP - 328

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -