Nonrepetitive colorings of line arrangements
From MaRDI portal
Publication:499479
DOI10.1016/J.EJC.2015.05.013zbMATH Open1321.05084OpenAlexW573807479MaRDI QIDQ499479FDOQ499479
Authors: Jarosław Grytczuk, Karol Kosiński, Michał Zmarz 
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
Recommendations
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- Nonrepetitive colorings of graphs
- Nonrepetitive and pattern-free colorings of the plane
- A note on coloring line arrangements
- Nonrepetitive graph colouring
- Nonrepetitive vertex colorings of graphs
- scientific article; zbMATH DE number 5130733
- Nonrepetitive colorings of graphs -- a survey
Cites Work
- On acyclic colorings of planar graphs
- The Mathematical Coloring Book
- Automatic Sequences
- Title not available (Why is that?)
- Nonrepetitive colorings of graphs
- Thue type problems for graphs, points, and numbers
- The origins of combinatorics on words
- Pattern avoidance: themes and variations
- Nonrepetitive colorings of graphs of bounded tree-width
- Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
- Multidimensional unrepetitive configurations
- Homomorphisms of edge-colored graphs and Coxeter groups
- Structural sparsity
- On square-free vertex colorings of graphs
Cited In (7)
- Non-repetitive colorings of infinite sets
- Fractional meanings of nonrepetitiveness
- Grasshopper avoidance of patterns
- Thue type problems for graphs, points, and numbers
- On avoding \(r\)-repetitions in \(\mathbb R^2\)
- Avoiding Multiple Repetitions in Euclidean Spaces
- Nonrepetitive and pattern-free colorings of the plane
This page was built for publication: Nonrepetitive colorings of line arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499479)
