Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge

DOI10.37236/10370zbMath1478.05057arXiv2102.00750OpenAlexW3211937613MaRDI QIDQ2665958

Matthieu Rosenfeld

Publication date: 22 November 2021

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

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

zbMATH Keywords

nonrepetitive chromatic indexnonrepetitively 3-colourable subdivision

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Nonrepetitive colouring via entropy compression
• Nonrepetitive vertex colorings of graphs
• Characterisations and examples of graph classes with bounded expansion
• Nonrepetitive colorings of graphs -- a survey
• Notes on nonrepetitive graph colouring
• Non-repetitive 3-coloring of subdivided graphs
• Nonrepetitive graph colouring
• Another approach to non-repetitive colorings of graphs of bounded degree
• Some further results on squarefree arithmetic progressions in infinite words
• Repetition thresholds for subdivided graphs and trees
• Two-Sided Bounds for the Growth Rates of Power-Free Languages
• Nonrepetitive colorings of graphs
• Unnamed Item

This page was built for publication: Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge