文章基本信息

标题：Complexity of Coloring Reconfiguration under Recolorability Constraints
本地全文：下载
作者：Hiroki Osawa ; Akira Suzuki ; Takehiro Ito 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：92
页码：62:1-62:12
DOI：10.4230/LIPIcs.ISAAC.2017.62
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：combinatorial reconfiguration; graph coloring; PSPACE-complete