Reconfiguring Graph Colorings
Loading...
Date
2017-08-29
Authors
Vaidyanathan, Krishna
Journal Title
Journal ISSN
Volume Title
Publisher
University of Waterloo
Abstract
Graph coloring has been studied for a long time and continues to receive
interest within the research community \cite{kubale2004graph}. It has applications
in scheduling \cite{daniel2004graph}, timetables, and compiler register
allocation \cite{lewis2015guide}. The most popular variant of graph coloring,
k-coloring, can be thought of as an assignment of $k$ colors to the vertices of a
graph such that adjacent vertices are assigned different colors.
Reconfiguration problems, typically defined on the solution space of search problems,
broadly ask whether one solution can be transformed to another solution using
step-by-step transformations, when constrained to one or more specific transformation
steps \cite{van2013complexity}. One well-studied reconfiguration problem is the
problem of deciding whether one k-coloring can be transformed to another k-coloring
by changing the color of one vertex at a time, while always maintaining a k-coloring
at each step.
We consider two variants of graph coloring: acyclic coloring and equitable
coloring, and their corresponding reconfiguration problems. A k-acylic coloring is
a k-coloring where there are more than two colors used by the vertices of each
cycle, and a k-equitable coloring is a k-coloring such that each color class, which is
defined as the set of all vertices with a particular color, is nearly the same
size as all others.
We show that reconfiguration of acyclic colorings is PSPACE-hard, and that for
non-bipartite graphs with chromatic number 3 there exist two k-acylic colorings
$f_s$ and $f_e$ such that there is no sequence of transformations that can
transform $f_s$ to $f_e$. We also consider the problem of whether two
k-acylic colorings can be transformed to each other in at most $\ell$ steps, and
show that it is in XP, which is the class of algorithms that run in time
$O(n^{f(k)})$ for some computable function $f$ and parameter $k$, where in this
case the parameter is defined to be the length of the reconfiguration sequence
plus the length of the longest induced cycle.
We also show that the reconfiguration of equitable colorings is PSPACE-hard
and W[1]-hard with respect to the number of vertices with the same color. We
give polynomial-time algorithms for Reconfiguration of Equitable Colorings when
the number of colors used is two and also for paths when the number of colors
used is three.