M. Aouchiche and P. Hansen, A survey of Nordhaus???Gaddum type relations, Discrete Applied Mathematics, vol.161, issue.4-5, pp.466-546, 2013.
DOI : 10.1016/j.dam.2011.12.018

J. Araujo, C. Linhares, and . Sales, On the Grundy number of graphs with few P 4 's, Discrete Appl, Math, vol.160, pp.2514-2522, 2012.

M. Asté and F. , Havet and C. Linhares-Sales, Grundy number and products of graphs, Discrete Math, pp.310-1482, 2010.

C. A. Christen and S. M. Selkow, Some perfect coloring properties of graphs, Journal of Combinatorial Theory, Series B, vol.27, issue.1, pp.49-59, 1979.
DOI : 10.1016/0095-8956(79)90067-4
URL : http://doi.org/10.1016/0095-8956(79)90067-4

B. Effantin and H. Kheddouci, Grundy number of graphs, Discussiones Mathematicae Graph Theory, vol.27, issue.1, pp.5-18, 2007.
DOI : 10.7151/dmgt.1339
URL : https://hal.archives-ouvertes.fr/hal-00174212

P. Erd?-os, S. T. Hedetniemi, R. C. Laskar, and G. C. Prins, On the equality of the partial Grundy and upper ochromatic numbers of graphs, Discrete Mathematics, vol.272, issue.1, pp.53-64, 2003.
DOI : 10.1016/S0012-365X(03)00184-5

Z. Füredi, A. Gyárfás, G. Sárközy, and S. Selkow, Inequalities for the first-fit chromatic number, Journal of Graph Theory, vol.306, issue.23, pp.75-88, 2008.
DOI : 10.1002/jgt.20327

N. Gastineau, H. Kheddouci, and O. Togni, On the family of r-regular graphs with Grundy number r + 1, Discrete Math, pp.5-15, 2014.

C. Germain and H. Kheddouci, Grundy coloring for power graphs, Electronic Notes in Discrete Mathematics, vol.15, pp.65-67, 2003.
DOI : 10.1016/S1571-0653(04)00533-5
URL : https://hal.archives-ouvertes.fr/hal-00188420

K. Thilagavathi, D. Vijayalakshmi, and N. Roopesh, b-Colouring of Central Graphs, International Journal of Computer Applications, vol.3, issue.11, pp.27-29, 2010.
DOI : 10.5120/779-1103
URL : http://doi.org/10.5120/779-1103

M. Zaker, Results on the Grundy chromatic number of graphs, Discrete Math, pp.3166-3173, 2006.