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

J. Balogh, S. G. Hartke, Q. Liu, and G. Yu, On the First-Fit Chromatic Number of Graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.887-900, 2008.
DOI : 10.1137/060672479

S. Cabello and M. Jakovac, On the b-chromatic number of regular graphs, Discrete Applied Mathematics, vol.159, issue.13, pp.1303-1310, 2011.
DOI : 10.1016/j.dam.2011.04.028

V. Campos and A. Gyárfás, New Bounds on the Grundy Number of Products of Graphs, Journal of Graph Theory, vol.306, issue.23, pp.78-88, 2012.
DOI : 10.1002/jgt.20633
URL : https://hal.archives-ouvertes.fr/inria-00470158

G. Jennhwa, C. , and H. Hsu, First-fit chromatic numbers of d-degenerate graphs, Discrete Mathematics, vol.312, pp.2088-2090, 2012.

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

P. Erd?s, 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. N. 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

F. Havet and L. Sampaio, On the Grundy and b-Chromatic Numbers of a Graph, Algorithmica, vol.306, issue.23, pp.885-899, 2013.
DOI : 10.1007/s00453-011-9604-4
URL : https://hal.archives-ouvertes.fr/hal-00905927

M. Jakovac and S. Klav?ar, The b-Chromatic Number of Cubic Graphs, Graphs and Combinatorics, vol.306, issue.1, pp.107-118, 2010.
DOI : 10.1007/s00373-010-0898-9

A. El, S. , and M. Kouidder, b-chromatic number of regular graphs, Utilitas Mathematica, vol.80, pp.211-216, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01301071

S. Shaebani, On the <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>b</mml:mi></mml:math>-chromatic number of regular graphs without 4-cycle, Discrete Applied Mathematics, vol.160, issue.10-11, pp.1610-1614, 2012.
DOI : 10.1016/j.dam.2012.02.001

Z. Shi, W. Goddard, S. T. Hedetniemi, K. Kennedy, R. Laskar et al., An algorithm for partial Grundy number on trees, Discrete Mathematics, vol.304, issue.1-3, pp.108-116, 2005.
DOI : 10.1016/j.disc.2005.09.008

S. Yahiaoui and B. Effantin, On the grundy number of cubic graphs, 2012.

M. Zaker, Results on the Grundy chromatic number of graphs, Discrete Mathematics, vol.306, issue.23, pp.3166-3173, 2006.
DOI : 10.1016/j.disc.2005.06.044