Another approach to non-repetitive colorings of graphs of bounded degree
From MaRDI portal
Publication:2195220
DOI10.37236/9667zbMath1441.05083arXiv2006.09094OpenAlexW3083052155MaRDI QIDQ2195220
Publication date: 8 September 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.09094
Related Items (10)
Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge ⋮ A General Framework for Hypergraph Coloring ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Counting colorings of triangle-free graphs ⋮ Graphs of low average degree without independent transversals ⋮ Extensions and reductions of squarefree words ⋮ Optimization in graphical small cancellation theory ⋮ Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters ⋮ Lower-bounds on the growth of power-free languages over large alphabets ⋮ Nonrepetitive list colorings of the integers
Cites Work
- Strict bounds for pattern avoidance
- Nonrepetitive colouring via entropy compression
- Further applications of a power series method for pattern avoidance
- Nonrepetitive vertex colorings of graphs
- Total Thue colourings of graphs
- The local cut lemma
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- Acyclic edge-coloring using entropy compression
- Doubled patterns are 3-avoidable
- Nonrepetitive list colourings of paths
- A constructive proof of the general lovász local lemma
- Nonrepetitive colorings of graphs
- New approach to nonrepetitive sequences
- Planar graphs have bounded nonrepetitive chromatic number
- Nonrepetitive colorings of graphs
This page was built for publication: Another approach to non-repetitive colorings of graphs of bounded degree
