Every k-tree and partial k-tree admits an online nonrepetitive coloring with 4^k colors, and online paths need only 12 colors.
Planar graphs have bounded nonrepetitive chromatic number
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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 half. We show that planar graphs have nonrepetitive colourings with a bounded number of colours, thus proving a conjecture of Alon, Grytczuk, Haluszczak and Riordan (2002). We also generalise this result for graphs of bounded Euler genus, graphs excluding a fixed minor, and graphs excluding a fixed topological minor.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A note about online nonrepetitive coloring $k$-trees
Every k-tree and partial k-tree admits an online nonrepetitive coloring with 4^k colors, and online paths need only 12 colors.