Establishes PSPACE-completeness of (d,k)-Coloring Reconfiguration for d>=2 on multiple restricted graph classes and a quadratic-time algorithm on paths.
Finding Paths Between 3-Colorings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distance Recoloring
Establishes PSPACE-completeness of (d,k)-Coloring Reconfiguration for d>=2 on multiple restricted graph classes and a quadratic-time algorithm on paths.