1 paper
Manoel Campêlo, Phablo F. S. Moura, Joel C. Soares
A coloring of the vertices of a connected graph is convex if each color class induces a connected subgraph. We address the convex recoloring (CR) problem defined as follows. Given…