Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs   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.

4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
31
The categories of this paper are: ao-sci
5
The categories of this paper are: gr-qc
23
The categories of this paper are: solv-int
0
The categories of this paper are: hep-ph
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat