Notes on nonrepetitive graph colouring

zbMath1163.05316arXivmath/0509608MaRDI QIDQ1010826

János Barát, David R. Wood

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0509608

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A note on the thue chromatic number of lexicographic products of graphs ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ New bounds for facial nonrepetitive colouring ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Restricted coloring problems on graphs with few \(P_4\)'s ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ Nonrepetitive list colorings of the integers ⋮ The complexity of nonrepetitive coloring ⋮ On tree-partition-width