N. Alon, J. Grytczuk, M. Ha?uszczak, and O. Riordan, Nonrepetitive colorings of graphs, Random Struct. Algor, vol.21, pp.336-346, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01184372

N. Alon, C. Mcdiarmid, and B. Reed, Acyclic coloring of graphs, Random Struct. Algor, vol.2, issue.3, pp.277-288, 1991.

N. Alon, B. Sudakov, and A. Zaks, Acyclic edge colorings of graphs, J. Graph Theor, vol.37, issue.3, pp.157-167, 2001.

N. R. Aravind and C. R. Subramanian, Bounds on vertex colorings with restrictions on the union of color classes, J. Graph Theor, vol.66, issue.3, pp.213-234, 2011.

N. R. Aravind and C. R. Subramanian, Forbidden subgraph colorings and the oriented chromatic number, Eur. J. Combin, vol.34, issue.3, pp.620-631, 2013.

J. Barát and J. Czap, Facial nonrepetitive vertex coloring of plane graphs, J. Graph Theor, vol.77, pp.115-121, 2013.

M. I. Burstein, Every 4-valent graph has an acyclic 5-colouring, B. Acad. Sci. Georgian SSR, vol.93, issue.1, pp.21-24, 1979.

Y. Dieng, H. Hocquard, and R. Naserasr, Acyclic coloring of graphs with maximum degree bounded, Proc. of 8FCC, 2010.

V. Dujmovi?, G. Joret, J. Kozik, and D. R. Wood, Nonrepetitive colouring via entropy compression. Combinatorica, to appear, 2014.

L. Esperet and A. Parreau, Acyclic edge-coloring using entropy compression, Eur. J. Combin, vol.34, issue.6, pp.1019-1027, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00843770

P. Erd?s and L. Lovász, Infinite and Finite Sets (to Paul Erd?s on his 60th birthday) II. North-Holland, pp.609-627, 1973.

G. Fertin and A. Raspaud, Acyclic coloring of graphs of maximum degree five: nine colors are enough, Inform. Process. Lett, vol.105, issue.2, pp.65-72, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00416567

G. Fertin, A. Raspaud, and B. Reed, Star coloring of graphs, J. Graph Theor, vol.47, issue.3, pp.163-182, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307788

A. Fiedorowicz, Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree, Discuss. Math. Graph Theor, vol.33, issue.1, pp.91-99, 2013.

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00072739

S. Gerke, C. Greenhill, and N. Wormald, The generalized acyclic edge chromatic number of random regular graphs, J. Graph Theor, vol.53, issue.2, pp.101-125, 2006.

C. Greenhill and O. Pikhurko, Bounds on the generalized acyclic chromatic numbers of bounded degree graphs, Graphs Combinator, vol.21, issue.4, pp.407-419, 2005.

B. Grünbaum, Acyclic colorings of planar graphs, Israel J. Math, vol.14, pp.390-408, 1973.

J. Grytczuk, Nonrepetitive colorings of graphs -a survey, Int. J. Math. Math. Sci, vol.74639, 2007.

J. Grytczuk, J. Kozik, and P. Micek, New approach to nonrepetitive sequences, Random Struct. Algor, vol.42, issue.2, pp.214-225, 2013.

H. Hatami, ? + 300 is a bound on the adjacent vertex distinguishing edge chromatic number, J. Comb. Theory B, vol.95, issue.2, pp.246-256, 2005.

F. Havet, J. Van-den-heuvel, C. Mcdiarmid, and B. Reed, List colouring squares of planar graphs, INRIA, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00303303

H. Hocquard, Acyclic coloring of graphs with maximum degree six, Inform. Process. Lett, vol.111, issue.15, pp.748-753, 2011.

G. Joret, Private communication, 2014.

A. V. Kostochka and C. Stocker, Graphs with maximum degree 5 are acyclically 7-colorable, Ars Math. Contemp, vol.4, pp.153-164, 2011.

A. Meir and J. Moon, On an asymptotic method in enumeration, J. Combin. Theory, Ser. A, vol.51, issue.1, pp.77-89, 1989.

M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, J. Comb. Theory B, vol.69, issue.2, pp.103-109, 1997.

M. Molloy and B. Reed, A bound on the total chromatic number, Combinatorica, vol.18, issue.2, pp.241-280, 1998.

R. A. Moser and G. Tardos, A constructive proof of the general lovasz local lemma, J. ACM, vol.57, issue.2, pp.1-15, 2010.

S. Ndreca, A. Procacci, and B. Scoppola, Improved bounds on coloring of graphs, Eur. J. Combin, vol.33, issue.4, pp.592-609, 2012.

J. Przyby?o, On the Facial Thue Choice Index via Entropy Compression, J. Graph Theor. online, 2013.

J. Przyby?o, J. Schreyer, and E. , On the facial Thue choice number of plane graphs via entropy compression method, 2013.

J. Schreyer and E. ?krabul'áková, On the facial Thue choice index of plane graphs, Discrete Math, vol.312, issue.10, pp.1713-1721, 2012.

J. Sereni and J. Volec, A note on acyclic vertex-colorings
URL : https://hal.archives-ouvertes.fr/hal-00921122

A. Thue, Über unendliche zeichenreihen. Norske Vid, Selsk. Skr. I. Mat. Nat. Kl. Christiania, vol.7, pp.1-22, 1906.

K. Yadav, S. Varagani, K. Kothapalli, V. Ch, and . Venkaiah, Acyclic vertex coloring of graphs of maximum ?, Proc. of Indian Mathematical Society, 2009.

K. Yadav, S. Varagani, K. Kothapalli, V. Ch, and . Venkaiah, Acyclic vertex coloring of graphs of maximum degree 6, Electron. Notes Discrete Math, vol.35, pp.177-182, 2009.

K. Yadav, S. Varagani, K. Kothapalli, V. Ch, and . Venkaiah, Acyclic vertex coloring of graphs of maximum degree 5, Discrete Math, vol.311, issue.5, pp.342-348, 2011.