M. Asté and F. , Grundy number and products of graphs, Discrete Mathematics, vol.310, issue.9, pp.1482-1490, 2010.
DOI : 10.1016/j.disc.2009.09.020

M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences, 1979.

F. Havet and L. Sampaio, On the Grundy Number of a Graph, Proceedings of the International Symposium on Parameterized and Exact Computation(IPEC), Lecture Notes on Computer science 6478, 2010.
DOI : 10.1016/j.disc.2005.06.044
URL : https://hal.archives-ouvertes.fr/inria-00532906

I. Holyer, The NP-Completeness of Edge-Coloring, SIAM Journal on Computing, vol.10, issue.4, pp.225-231, 1981.
DOI : 10.1137/0210055

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc. 25th ACM Symposium on Theory of Computing, pp.286-293, 1993.

M. Zaker, Results on the Grundy chromatic number of graphs. Discrete Math, Inria RESEARCH CENTRE SOPHIA ANTIPOLIS ? MÉDITERRANÉE 2004 route des Lucioles -BP 93, pp.3166-3173, 2006.