On nonrepetitive colorings of paths and cycles

Fábio Botler, Wanderson Lomenha, João Pedro de Souza

We say that a sequence $a_1\cdots a_{2t}$ of integers is repetitive if $a_i=a_{i+t}$ for every $i\in \{1,\dots ,t\}$. A walk in a graph $G$ is a sequence $v_1\cdots v_r$ of vert…