Nonrepetitive colorings of graphs
From MaRDI portal
Publication:5899395
DOI10.1016/j.endm.2007.01.063zbMath1291.05058OpenAlexW4230526004MaRDI QIDQ5899395
Sebastian Czerwiński, Jarek Grytczuk
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.063
Related Items (10)
On the facial Thue choice number of plane graphs via entropy compression method ⋮ A note on the thue chromatic number of lexicographic products of graphs ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ On the facial Thue choice index of plane graphs ⋮ How far away must forced letters be so that squares are still avoidable? ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Nonrepetitive colouring via entropy compression ⋮ Efficient counting of square substrings in a tree ⋮ Total Thue colourings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonrepetitive colorings of trees
- Thue type problems for graphs, points, and numbers
- Graph minors. V. Excluding a planar graph
- Avoidable patterns in strings of symbols
- 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
- Coloring with no 2-colored \(P_4\)'s
- 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
- Open Problems in Pattern Avoidance
- Automatic Sequences
- Nonrepetitive colorings of graphs
- The Map-Coloring Game
This page was built for publication: Nonrepetitive colorings of graphs
