The connected Grundy coloring problem: Formulations and a local-search enhanced biased random-key genetic algorithm

Mateus C. Silva, Rafael A. Melo, Mauricio G. C. Resende +2

Given a graph G=(V,E), a connected Grundy coloring is a proper vertex coloring that can be obtained by a first-fit heuristic on a connected vertex sequence. A first-fit coloring he…