Anagram-Free Colorings of Graph Subdivisions

DOI10.1137/17M1145574zbMath1396.05042arXiv1708.09571OpenAlexW2964094587WikidataQ129181424 ScholiaQ129181424MaRDI QIDQ4684464

David R. Wood, Tim E. Wilson

Publication date: 1 October 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

subdivisiontreesvertex coloringanagram-free coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

\(2\times n\) grids have unbounded anagram-free chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Nonrepetitive colouring via entropy compression
• Nonrepetitive vertex colorings of graphs
• Characterisations and examples of graph classes with bounded expansion
• A powerful abelian square-free substitution over 4 letters
• Nonrepetitive colorings of trees
• Nonrepetitive colorings of graphs -- a survey
• Notes on nonrepetitive graph colouring
• Non-repetitive 3-coloring of subdivided graphs
• Anagram-free graph colouring
• Anagram-Free Colourings of Graphs
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences
• Abelian squares are avoidable on 4 letters

This page was built for publication: Anagram-Free Colorings of Graph Subdivisions