Nonrepetitive colorings of line arrangements

DOI10.1016/j.ejc.2015.05.013zbMath1321.05084OpenAlexW573807479MaRDI QIDQ499479

Jarosław Grytczuk, Michał Zmarz, Karol Kosiński

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.05.013

zbMATH Keywords

Hadwiger-Nelson problemnonrepetitive sequences

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Fractional meanings of nonrepetitiveness ⋮ On avoding \(r\)-repetitions in \(\mathbb R^2\) ⋮ Grasshopper avoidance of patterns ⋮ Nonrepetitive and pattern-free colorings of the plane ⋮ Avoiding Multiple Repetitions in Euclidean Spaces

Cites Work

• Unnamed Item
• Pattern avoidance: themes and variations
• The origins of combinatorics on words
• Thue type problems for graphs, points, and numbers
• Nonrepetitive colorings of graphs of bounded tree-width
• Multidimensional unrepetitive configurations
• On acyclic colorings of planar graphs
• Homomorphisms of edge-colored graphs and Coxeter groups
• Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
• Structural sparsity
• The Mathematical Coloring Book
• On square-free vertex colorings of graphs
• Automatic Sequences
• Nonrepetitive colorings of graphs

This page was built for publication: Nonrepetitive colorings of line arrangements