Anagram-free colorings of graphs

DOI10.1016/J.ENDM.2017.07.022zbMath1379.05036arXiv1606.09062OpenAlexW2963375079MaRDI QIDQ1689991

Tomasz Łuczak, Nina Kamčev, Benjamin Sudakov

Publication date: 18 January 2018

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

zbMATH Keywords

coloringrandom regular graphanagram

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Facial anagram-free edge-coloring of plane graphs ⋮ Anagram-free colorings of graphs ⋮ Anagram-free graph colouring

Cites Work

• Nonrepetitive colorings of graphs -- a survey
• Anagram-free colorings of graphs
• Hamiltonicity thresholds in Achlioptas processes
• Nonrepetitive colorings of graphs
• Abelian squares are avoidable on 4 letters

This page was built for publication: Anagram-free colorings of graphs