A vertex colouring of a graph $ G $ is" nonrepetitive" if $ G $ contains no path for which the
first half of the path is assigned the same sequence of colours as the second half. Thue's …

A vertex coloring f of a graph G is nonrepetitive if there are no integer r≥ 1 and a simple
path v1,…, v2r in G such that f (vi)= f (vr+ i) for all i= 1,…, r. This notion is a graph‐theoretic …

A colouring of a graph is" nonrepetitive" if for every path of even order, the sequence of
colours on the first half of the path is different from the sequence of colours on the second …

A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the
same sequence of colours as the second half. A graph is nonrepetitively ℓ-choosable if …

A sequence S= s1s2… sn is said to be nonrepetitive if no two adjacent blocks of S are the
same. A celebrated 1906 theorem of Thue asserts that there are arbitrarily long nonrepetitive …

Pattern avoidance: themes and variations Page 1 Theoretical Computer Science 339 (2005) 7 –
18 www.elsevier.com/locate/tcs Pattern avoidance: themes and variations James D. Currie ∗,1 …

The interplay between words, computability, algebra and arithmetic has now proved its
relevance and fruitfulness. Indeed, the cross-fertilization between formal logic and finite …

In this survey the following types of colorings of plane graphs are discussed, both in their
vertex and edge versions: facially proper coloring, rainbow coloring, antirainbow coloring …

A coloring of the vertices of a graph G is nonrepetitive if no path in G forms a sequence
consisting of two identical blocks. The minimum number of colors needed is the Thue …

A vertex colouring of a graph is\emph {nonrepetitive on paths} if there is no path $ v_1,
v_2,..., v_ {2t} $ such that v_i and v_ {t+ i} receive the same colour for all i= 1, 2,..., t. We …