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 x and y , x < y , any vertex colored y is adjacent to some vertex colored x . The First-Fit or Grundy chromatic number (or simply Grundy number) of a graph G , denoted by Γ ( G ) , is the largest integer k , such that there exists a Grundy k -coloring for G . It can be easily seen that Γ ( G ) equals to the maximum number of colors used by the greedy (or First-Fit) coloring of G . In this paper, we obtain the Grundy chromatic number of Cartesian Product of path graph, complete graph, cycle graph, complete graph, wheel graph and star graph.