N. Alon, J. Grytczuk, M. Haluszcak, and O. Riordan, Nonrepetitive colorings of graphs, Random Structures and Algorithms, vol.7, issue.3-4, pp.336-346, 2002.
DOI : 10.1002/rsa.10057
URL : https://hal.archives-ouvertes.fr/hal-01184372

D. W. Barnette, Trees in polyhedral graphs, Canad, J. Math, vol.18, pp.731-736, 1966.

B. Bre?tar, J. Grytzuk, S. Klav?ar, S. Niwczyk, and I. Peterin, Non-repetitive colorings of trees, Discrete Math, pp.163-172, 2007.

J. D. Currie, Open Problems in Pattern Avoidance, The American Mathematical Monthly, vol.100, issue.8, pp.790-793, 1993.
DOI : 10.2307/2324790

J. D. Currie, There are ternary circular square-free words of length n for n ? 18, Electron. J. Combin, vol.9, p.10, 2002.

J. D. Currie, Pattern avoidance: themes and variations, Theoretical Computer Science, vol.339, issue.1, pp.7-18, 2005.
DOI : 10.1016/j.tcs.2005.01.004
URL : http://doi.org/10.1016/j.tcs.2005.01.004

H. J. Fleischner, D. P. Geller, and F. Harary, Outerplanar graphs and weak duals, J. Indian Math Soc, vol.38, pp.215-219, 1974.

R. P. Gupta, The chromatic index and the degree of a graph, Not. Amer. Math. Soc, vol.13, p.719, 1966.

J. Grytczuk and W. Sliwa, Non-repetitive colorings of infinite sets, Discrete Math, pp.365-373, 2003.

J. Grytczuk, Thue type problems of graphs, points and numbers, Discrete Math, pp.4419-4429, 2008.

J. Grytczuk, Pattern avoidance on graphs, Discrete Math, pp.1341-1346, 2007.

A. Kündgen and M. J. Pelsmajer, Non-repetitive colorings of graphs of bounded tree-width, Discrete Math, pp.4473-4478, 2008.

N. Rampersad, A note on non-repetitive colourings of planar graphs, pp.1-3, 2003.

N. Robertson, D. P. Sanders, P. Seymour, and R. Thomas, The Four-Colour Theorem, Journal of Combinatorial Theory, Series B, vol.70, issue.1, pp.2-44, 1997.
DOI : 10.1006/jctb.1997.1750

C. E. Shannon, A Theorem on Coloring the Lines of a Network, Journal of Mathematics and Physics, vol.28, issue.1-4, pp.148-151, 1949.
DOI : 10.1002/sapm1949281148

P. G. Tait, XXIII.???Note on a Theorem in Geometry of Position., Transactions of the Royal Society of Edinburgh, vol.29, issue.02, pp.657-660, 1880.
DOI : 10.1017/S008045680002617X

V. G. Vizing, On an estimate of the chromatic class of a p-graph, Metody Diskret, Analyz, vol.3, pp.25-30, 1964.

R. A. Wilson, Graphs, colourings and the four-colour theorem, 2002.