A. Aberkane and J. D. Currie, There exist binary circular 5/2 + power free words of every length, Electron. J. Combin, vol.11, p.10, 2004.

A. Carpi, On Dejean's conjecture over large alphabets, Theoret. Comput. Sci, vol.385, issue.1-3, pp.137-151, 2007.

J. D. Currie, There are ternary circular square-free words of length n for n 18, Electron. J. Combin, vol.9, pp.1-7, 2002.

J. D. Currie and N. Rampersad, Dejean's conjecture holds for n 27, RAIRO -Theoretical Informatics and Applications, vol.43, issue.4, pp.775-778, 2009.

J. D. Currie and N. Rampersad, Dejean's conjecture holds for n 30

, Comput. Sci, vol.410, pp.2885-2888, 2009.

J. D. Currie and N. Rampersad, A proof of Dejean's conjecture, Math. Comp, vol.80, pp.1063-1070, 2011.

F. Dejean, Sur un théorème de Thue, J. Combin. Theory Ser. A, vol.13, pp.90-99, 1972.

I. A. Gorbunova, Repetition threshold for circular words, Electron. J. Combin, vol.19, issue.4, p.11, 2012.

M. Mohammad-noori and J. D. Currie, Dejean's conjecture and Sturmian words, Europ. J. Combin, vol.28, issue.3, pp.876-890, 2007.

J. and M. Ollagnier, Proof of Dejean's conjecture for alphabets with 5, Theoret. Comput. Sci, vol.95, issue.2, pp.187-205, 1992.

P. Ochem and E. Vaslet, Repetition thresholds for subdivided graphs and trees, vol.46, pp.123-130, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00739384

J. Pansiot, A propos d'une conjecture de F. Dejean sur les répétitions dans les mots, Discrete Appl. Math, vol.7, issue.3, pp.297-311, 1984.

M. Rao, Last cases of Dejean's conjecture, Theoret. Comput. Sci, vol.412, issue.27, pp.3010-3018, 2011.