Nonrepetitive colorings of graphs

DOI10.1002/rsa.10057zbMath1018.05032MaRDI QIDQ4798171

Noga Alon, Oliver Riordan, Jarosław Grytczuk, Mariusz Hałuszczak

Publication date: 19 March 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10057

zbMATH Keywords

nonrepetitive sequences; graph colorings; Thue number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

New approach to nonrepetitive sequences, Nonrepetitive colorings of graphs, Nonrepetitive colorings of graphs, Thue choosability of trees, Pattern avoidance: themes and variations, Nonrepetitive vertex colorings of graphs, Characterisations and examples of graph classes with bounded expansion, Nonrepetitive colorings of trees, Pattern avoidance on graphs, Some results in square-free and strong square-free edge-colorings of graphs, Nonrepetitive colorings of graphs -- a survey, Thue type problems for graphs, points, and numbers, Nonrepetitive colorings of graphs of bounded tree-width, The complexity of nonrepetitive coloring, Generalization of transitive fraternal augmentations for directed graphs and its applications, Optimal strong parity edge-coloring of complete graphs, Breaking the rhythm on graphs, Facial Nonrepetitive Vertex Coloring of Plane Graphs, Splitting necklaces and measurable colorings of the real line

Cites Work

• Substitution dynamical systems - spectral analysis