Abstract

Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices. In the RAINBOW VERTEX COLORING (RVC) problem we want to decide
... read more