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

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

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

R. W. Irving and D. F. Manlove, The b-chromatic number of a graph, Discrete Applied Mathematics, vol.91, issue.1-3, pp.127-141, 1999.
DOI : 10.1016/S0166-218X(98)00146-2

J. Kratochvíl, Z. Tuza, and M. Voigt, On the b-Chromatic Number of Graphs, Lecture Notes in Computer Science
DOI : 10.1007/3-540-36379-3_27

C. T. Hoang, Perfect graphs, ProQuest LLC, thesis (Ph.D.)?McGill University (Canada), 1985.

B. Jamison and S. Olariu, Recognizing $P_4 $-Sparse Graphs in Linear Time, SIAM Journal on Computing, vol.21, issue.2, pp.381-406, 1992.
DOI : 10.1137/0221027

A. Gyárfás and J. , On-line and first fit colorings of graphs, Journal of Graph Theory, vol.29, issue.2, pp.217-227, 1988.
DOI : 10.1002/jgt.3190120212

J. C. Araújo and C. , Grundy number on -classes, Electronic Notes in Discrete Mathematics, vol.35, pp.21-27, 2009.
DOI : 10.1016/j.endm.2009.11.005

F. Bonomo, G. Durán, F. Maffray, J. Marenco, and M. Valencia-pabon, On the b-coloring of cographs and P 4 -sparse graphs, Graphs Combin, pp.153-167, 2009.

L. Babel and S. Olariu, On the structure of graphs with few P4s, Discrete Applied Mathematics, vol.84, issue.1-3, pp.1-13, 1998.
DOI : 10.1016/S0166-218X(97)90120-7

B. Jamison and S. , P-Components and the Homogeneous Decomposition of Graphs, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.448-463, 1995.
DOI : 10.1137/S0895480191196812

L. Babel, T. Kloks, J. Kratochvil, D. Kratsch, H. Müller et al., Efficient algorithms for graphs with few P 4 's, Discrete Math, pp.29-51, 1998.

D. G. Corneil, Y. Perl, and L. Stewart, Cographs: recognition, applications and algorithms, Proceedings of the fifteenth Southeastern conference on combinatorics, graph theory and computing, pp.249-258, 1984.

B. Jamison and S. Olariu, Linear time optimization algorithms for P4-sparse graphs, Discrete Applied Mathematics, vol.61, issue.2, pp.155-175, 1995.
DOI : 10.1016/0166-218X(94)00012-3