A. Carpi, On Dejean???s conjecture over large alphabets, Theoretical Computer Science, vol.385, issue.1-3, pp.137-151, 2007.
DOI : 10.1016/j.tcs.2007.06.001
URL : http://doi.org/10.1016/j.tcs.2007.06.001

C. Choffrut and J. Karhumäki, Combinatorics of Words, Handbook of Formal Languages, pp.329-438, 1997.
DOI : 10.1007/978-3-642-59136-5_6

M. Mohammad-noori and J. D. Currie, Dejean???s conjecture and Sturmian words, European Journal of Combinatorics, vol.28, issue.3, pp.876-890, 2007.
DOI : 10.1016/j.ejc.2005.11.005
URL : http://doi.org/10.1016/j.ejc.2005.11.005

F. Dejean, Sur un th??or??me de Thue, Journal of Combinatorial Theory, Series A, vol.13, issue.1, pp.90-99, 1972.
DOI : 10.1016/0097-3165(72)90011-8
URL : http://doi.org/10.1016/0097-3165(72)90011-8

R. Kolpakov, G. Kucherov, and Y. Tarannikov, On repetition-free binary words of minimal density, Theoretical Computer Science, vol.218, issue.1, pp.161-175, 1999.
DOI : 10.1016/S0304-3975(98)00257-6
URL : https://hal.archives-ouvertes.fr/inria-00098692

J. Moulin-ollagnier, Proof of Dejean's conjecture for alphabets with 5, Theoret. Comput. Sci, vol.6, issue.95, pp.187-205, 1992.

P. Ochem, Letter frequency in infinite repetition-free words, Theoretical Computer Science, vol.380, issue.3, pp.388-392, 2007.
DOI : 10.1016/j.tcs.2007.03.027
URL : http://doi.org/10.1016/j.tcs.2007.03.027

P. Ochem and T. Reix, Upper bound on the number of ternary square-free words, Workshop on Words and Automata (WOWA'06), 2006.

J. Pansiot, A propos d'une conjecture de F. Dejean sur les r??p??titions dans les mots, Discrete Applied Mathematics, vol.7, issue.3, pp.297-311, 1984.
DOI : 10.1016/0166-218X(84)90006-4

C. Richard and U. Grimm, On the entropy and letter frequencies of ternary square-free words, Electron, J. Comb, vol.11, p.14, 2004.

Y. Tarannikov, The minimal density of a letter in an infinite ternary square-free word is 0.2746, J. Integer Sequences, vol.5, issue.2, pp.2-2, 2002.