The Electronic Journal of Combinatorics · 2002 · 78 citations · 5 references
Natural SciencesMathematicsCombinatoricsCombinatorial Number Theory
There are circular square-free words of length $n$ on three symbols for $n\ge 18$. This proves a conjecture of R. J. Simpson.
5
Symbolic Dynamics II. Sturmian Trajectories
Marston Morse, Gustav A. Hedlund · American Journal of Mathematics · 1940 · 803 citations
James D. Currie, Jamie Simpson · The Electronic Journal of Combinatorics · 2002 · 21 citations · Full text
Which graphs allow infinite nonrepetitive walks?
James D. Currie · Discrete Mathematics · 1991 · 16 citations