A Grundy k-coloring of a graph G is a proper k-coloring of vertices in G using colors {1, 2, · · · , k} such that for any two colors i and j, i < j, any vertex colored j is adjacent to some vertex colored i. The First-Fit ...