C. A. References, S. M. Christen, and . Selkow, Some perfect coloring properties of graphs, Journal of Combinatorial Theory B, vol.27, pp.49-59, 1979.

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, 1989.

K. Edwards, The Harmonious Chromatic Number and the Achromatic Number, pp.13-47, 1997.
DOI : 10.1017/CBO9780511662119.003

P. Erd?-os, R. C. Laskar, W. R. Hare, and S. T. Hedetniemi, On the equality of the grundy and ochromatic numbers of a graph, Journal of Graph Theory, vol.40, issue.2, pp.157-159, 1987.
DOI : 10.1002/jgt.3190110205

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

U. Feige, M. Halldórsson, G. Kortsarz, and A. Srinivasan, Approximating the domatic number, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.172-195, 2002.
DOI : 10.1145/335305.335321

N. Goyal and S. Vishwanathan, NP-completeness of undirected grundy numbering and related problems, 1997.

A. Gyarfas and J. Lehel, 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

M. M. Halldórsson, Approximating the minimum maximal independence number, Information Processing Letters, vol.46, issue.4, pp.169-172, 1993.
DOI : 10.1016/0020-0190(93)90022-2

S. M. Hedetniemi, S. T. Hedetniemi, and T. Beyer, A linear algorithm for the grundy (coloring) number of a tree, Congressus Numerantium, vol.36, pp.351-363, 1982.

D. G. Hoffman and P. H. Johnson, Greedy coloring and the grundy chromatic number of the hypercube, Bulletin of the ICA, vol.26, pp.49-57, 1999.

T. R. Jensen and B. Toft, Graph Coloring Problems, 1995.
DOI : 10.1002/9781118032497

H. A. Kierstead, The Linearity of First-Fit Coloring of Interval Graphs, SIAM Journal on Discrete Mathematics, vol.1, issue.4, pp.526-530, 1988.
DOI : 10.1137/0401048

H. A. Kierstead, S. G. Penrice, and W. T. Trotter, On-Line Coloring and Recursive Graph Theory, SIAM Journal on Discrete Mathematics, vol.7, issue.1, pp.72-89, 1994.
DOI : 10.1137/S0895480192224737

G. Kortsarz, On the hardness of approximating spanners. Algorithmica, Special APPROX-98 issue, pp.432-450, 2001.

G. Kortsarz and S. Shende, Approximating the Achromatic Number Problem on Bipartite Graphs, Proceedings of 11th European Symposium on Algorithms, pp.385-396, 2003.
DOI : 10.1007/978-3-540-39658-1_36

G. Kortsarz, J. Radhakrishnan, and S. Sivasubramanian, Complete partitions of graphs, SODA, pp.860-869, 2005.

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, vol.41, issue.5, pp.960-981, 1994.
DOI : 10.1145/185675.306789

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

E. Petrank, The hardness of approximation: Gap location, Israel Symposium on Theory of Computing Systems, pp.275-284, 1993.

R. Raz, A Parallel Repetition Theorem, SIAM Journal on Computing, vol.27, issue.3, pp.763-803, 1998.
DOI : 10.1137/S0097539795280895

G. J. Simmons, On the ochromatic number of a graph, Congr. Numer, vol.40, pp.339-366, 1983.

J. A. Telle and A. Proskurowski, Algorithms for Vertex Partitioning Problems on Partial k-Trees, SIAM Journal on Discrete Mathematics, vol.10, issue.4, pp.529-550, 1997.
DOI : 10.1137/S0895480194275825

M. Zaker, The grundy chromatic number of the complement of bipartite graphs, Austral. Journal Combinatorics, vol.31, pp.325-329, 2005.

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