Name
Abstract | ||
|---|---|---|
For an integer k ge 1, k-coloring reconfiguration is one of the most well-studied reconfiguration problems, defined as follows: In the problem, we are given two (vertex-)colorings of a graph using k colors, and asked to transform one into the other by recoloring only one vertex at a time, while at all times maintaining a proper coloring. The problem is known to be PSPACE-complete if k ge 4, and solvable for any graph in polynomial time if k le 3. In this paper, we introduce a recolorability constraint on the k colors, which forbids some pairs of colors to be recolored directly. The recolorability constraint is given in terms of an undirected graph R such that each node in R corresponds to a color and each edge in R represents a pair of colors that can be recolored directly. We study the hardness of the problem based on the structure of recolorability constraints R. More specifically, we prove that the problem is PSPACE-complete if R is of maximum degree at least four, or has a connected component containing more than one cycle. |
Year | Venue | Field |
|---|---|---|
2017 | ISAAC | Integer,Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Computer science,Degree (graph theory),Connected component,Time complexity,Control reconfiguration |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroki Osawa | 1 | 0 | 0.34 |
| Akira Suzuki | 2 | 0 | 0.68 |
| Takehiro Ito | 3 | 260 | 40.71 |
| Xiao Zhou | 4 | 325 | 43.69 |