Nonrepetitive colorings of graphs -- a survey
From MaRDI portal
Publication:925326
DOI10.1155/2007/74639zbMath1139.05020OpenAlexW1981225002MaRDI QIDQ925326
Publication date: 3 June 2008
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/54166
Related Items (27)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ \((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Anagram-Free Colourings of Graphs ⋮ Repetition thresholds for subdivided graphs and trees ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Layered separators in minor-closed graph classes with applications ⋮ Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ New bounds for facial nonrepetitive colouring ⋮ A General Framework for Hypergraph Coloring ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Anagram-free colorings of graphs ⋮ Thue choosability of trees ⋮ A note about online nonrepetitive coloring \(k\)-trees ⋮ Fractional Thue chromatic number of graphs ⋮ Nonrepetitive vertex colorings of graphs ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Restricted coloring problems on graphs with few \(P_4\)'s ⋮ New approach to nonrepetitive sequences ⋮ Anagram-free graph colouring ⋮ Nonrepetitive colouring via entropy compression ⋮ Anagram-Free Colorings of Graph Subdivisions ⋮ Nonrepetitive list colourings of paths ⋮ Splitting necklaces and measurable colorings of the real line ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ On a generalization of Thue sequences ⋮ The local cut lemma
Cites Work
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of trees
- Nonrepetitive colorings of graphs of bounded tree-width
- Notes on nonrepetitive graph colouring
- Avoidable patterns in strings of symbols
- On acyclic colorings of planar graphs
- Homomorphisms of edge-colored graphs and Coxeter groups
- Non-repetitive tilings
- Orderings on graphs and game coloring number
- Thue-like sequences and rainbow arithmetic progressions
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Non-repetitive colorings of infinite sets
- Breaking the rhythm on graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- The fixing block method in combinatorics on words
- Which graphs allow infinite nonrepetitive walks?
- On square-free vertex colorings of graphs
- A 4-Color Theorem for Surfaces of Genus g
- Aperiodic words on three symbols.
- Aperiodic words on three symbols. II.
- Automatic Sequences
- Nonrepetitive colorings of graphs
- Oriented graph coloring
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Nonrepetitive colorings of graphs -- a survey
