Anagram-free colourings of graphs

DOI10.1017/S096354831700027XzbMATH Open1391.05111OpenAlexW2743768096MaRDI QIDQ3177364FDOQ3177364

Benny Sudakov, Tomasz Łuczak, Nina Kamčev

Publication date: 24 July 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354831700027x

Recommendations

• Anagram-free colorings of graphs
• Anagram-free graph colouring
• Anagram-Free Colorings of Graph Subdivisions
• Facial anagram-free edge-coloring of plane graphs
• \(2\times n\) grids have unbounded anagram-free chromatic number

zbMATH Keywords

anagram-chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Avoidable patterns in strings of symbols
• INFINITE PERIODIC GROUPS. I
• On the independence and chromatic numbers of random regular graphs
• Nonrepetitive colorings of graphs
• Nonrepetitive colorings of graphs -- a survey
• Thue type problems for graphs, points, and numbers
• Strongly non-repetitive sequences and progression-free sets
• Title not available (Why is that?)
• Abelian squares are avoidable on 4 letters
• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum number of perfect matchings in graphs with a given degree sequence
• Hamiltonicity thresholds in Achlioptas processes
• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
• Combinatorial mathematics VIII. Proceedings of the Eighth Australian Conference on Combinatorial Mathematics held at Deakin University, Geelong, Australia, August 25-29, 1980
• Splitting necklaces and measurable colorings of the real line

Cited In (6)

• The Zero Forcing Number of Graphs
• Anagram-Free Colorings of Graph Subdivisions
• \(2\times n\) grids have unbounded anagram-free chromatic number
• Anagram-free colorings of graphs
• Avoiding abelian powers cyclically
• On alternating anagrams

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177364)