  Coloring a graph is a well known problem and used in many different contexts.
Here we want to assign $k \geq 1$ colors to each vertex of a graph $G$ such
that each edge has two different colors at each endpoint. Such a
vertex-coloring, if exists, is called a feasible coloring of $G$.
\textsc{Distance Coloring} is an extension to the standard \textsc{Coloring}
problem. Here we want to enforce that every pair of distinct vertices of
distance less than or equal to $d$ have different colors, for integers $d \geq
1$ and $k \geq d+1$.
  Reconfiguration problems ask if two given configurations can be transformed
into each other with certain rules. For example, the well-known
\textsc{Coloring Reconfiguration} asks if there is a way to change one vertex's
color at a time, starting from a feasible given coloring $\alpha$ of a graph
$G$ to reach another feasible given coloring $\beta$ of $G$, such that all
intermediate colorings are also feasible. In this paper, we study the
reconfiguration of distance colorings on certain graph classes.
  We show that even for planar, bipartite, and $2$-degenerate graphs,
reconfiguring distance colorings is $\mathsf{PSPACE}$-complete for $d \geq 2$
and $k = \Omega(d^2)$ via a reduction from the well-known \textsc{Sliding
Tokens} problem. Additionally, we show that the problem on split graphs remains
$\mathsf{PSPACE}$-complete when $d = 2$ and large $k$ but can be solved in
polynomial time when $d \geq 3$ and $k \geq d+1$, and design a quadratic-time
algorithm to solve the problem on paths for any $d \geq 2$ and $k \geq d+1$.
