During the last two decades research on combinatorial problems of words, ie, on
Combinatorics on Words, has grown enormously. Although there has been important …

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 …

The Lovász Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding
all of a given set of “bad” events, with positive probability. A series of results have provided …

Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many
areas of combinatorial algebra. It contains self-contained proofs of more than 20 …

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 …

Classes with bounded expansion, which generalise classes that exclude a topological
minor, have recently been introduced by Nešetřil and Ossona de Mendez. These classes …

A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The
remarkable construction of Thue asserts that three symbols are enough to build an arbitrarily …

This text is aimed at doctoral students and researchers, who are interested in Combinatorics
and Graph Theory or who would just like to learn about some active topics and trends. But …

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 …

Squares (fragments of the form xx, for some string x) are arguably the most natural type of
repetition in strings. The basic algorithmic question concerning squares is to check if a given …