The list coloring reconfiguration problem for bounded pathwidth graphs

Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


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 seriesparallel 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 sharp analyses of the problem with respect to pathwidth.

Original languageEnglish
Pages (from-to)1168-1178
Number of pages11
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number6
Publication statusPublished - 2015 Jun 1


  • Graph algorithm
  • List coloring
  • PSPACE-complete
  • Pathwidth
  • Reachability on solution space
  • Reconfiguration


Dive into the research topics of 'The list coloring reconfiguration problem for bounded pathwidth graphs'. Together they form a unique fingerprint.

Cite this