M. O. Albertson, G. G. Chappell, H. A. Kierstead, A. Kündgen, and R. Ramamurthi, Coloring with no 2-colored P4's. Electron, J. Combin, vol.11, issue.1, p.26, 2004.

N. Alon, J. Grytczuk, M. Ha?uszczak, and O. Riordan, Nonrepetitive colorings of graphs, Random Structures & Algorithms, vol.21, pp.3-4336, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01184372

J. Barát and D. R. Wood, Notes on nonrepetitive graph colouring, Electron. J. Combin, vol.15, issue.1, p.99, 2008.

V. Dujmovi´cdujmovi´c, G. Joret, J. Kozik, and D. R. Wood, Nonrepetitive colouring via entropy compression, 2011.

G. Fertin, A. Raspaud, and B. Reed, On star coloring of graphs, Graph-Theoretic Concepts in Computer Science, pp.140-153, 2001.

F. Fiorenzi, P. Ochem, P. Ossona-de-mendez, and X. Zhu, Thue choosability of trees, Discrete Applied Mathematics, vol.159, issue.17, pp.2045-2049, 2011.
DOI : 10.1016/j.dam.2011.07.017
URL : https://hal.archives-ouvertes.fr/lirmm-00739373

J. Grytczuk, Nonrepetitive Colorings of Graphs??A Survey, International Journal of Mathematics and Mathematical Sciences, vol.9, issue.1, r28, 2007.
DOI : 10.1007/s00493-003-0034-z

J. Grytczuk, J. Przyby?o, and X. Zhu, Nonrepetitive list colourings of paths, Random Structures & Algorithms, vol.101, issue.1-2, pp.162-173, 2011.
DOI : 10.1002/rsa.20347

A. Kündgen and M. J. Pelsmajer, Nonrepetitive colorings of graphs of bounded tree-width, 11] A. Thue. ¨ Uber unendliche Zahlenreihen. Norske Vid Selsk Skr I Mat Nat Kl Christiana, pp.4473-44781, 1906.
DOI : 10.1016/j.disc.2007.08.043