Anagram-free graph colouring

zbMath1390.05077arXiv1607.01117MaRDI QIDQ1753108

Tim E. Wilson, David R. Wood

Publication date: 25 May 2018

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

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

zbMATH Keywords

abelian square-free sequencesanagram-free chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

\(2\times n\) grids have unbounded anagram-free chromatic number ⋮ Avoiding abelian powers cyclically ⋮ Anagram-Free Colorings of Graph Subdivisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• Pathwidth and nonrepetitive list coloring
• Nonrepetitive colouring via entropy compression
• Nonrepetitive vertex colorings of graphs
• A powerful abelian square-free substitution over 4 letters
• Nonrepetitive colorings of trees
• Nonrepetitive colorings of graphs -- a survey
• Strongly non-repetitive sequences and progression-free sets
• Anagram-free colorings of graphs
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Counting abelian squares
• Star coloring of graphs
• PATHWIDTH AND LAYERED DRAWINGS OF TREES
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences
• Abelian squares are avoidable on 4 letters
• Partially abelian squarefree words

This page was built for publication: Anagram-free graph colouring