An algorithm for partial Grundy number on trees

A coloring of a graph G=(V,E) is a partition {V1,V2,…,Vk} of V into independent sets or color classes. A vertex v∈Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj for every j