Nonrepetitive colorings of line arrangements
type: Item
instance of: scholarly article
title: Nonrepetitive colorings of line arrangements
zbMATH Open document ID: 1321.05084
author: Jarosław Grytczuk
author: Karol Kosiński
author: Michał Zmarz
published in: European Journal of Combinatorics
publication date: 2015-09-30T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6487472
zbMATH Keywords: nonrepetitive sequences
zbMATH Keywords: Hadwiger-Nelson problem
MaRDI profile type: Publication
full work available at URL: j.ejc.2015.05.013
OpenAlex ID: W573807479
cites work: Automatic Sequences
cites work: Nonrepetitive colorings of graphs
cites work: Homomorphisms of edge-colored graphs and Coxeter groups
cites work: On square-free vertex colorings of graphs
cites work: The origins of combinatorics on words
cites work: On acyclic colorings of planar graphs
cites work: Multidimensional unrepetitive configurations
cites work: Pattern avoidance: themes and variations
cites work: Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
cites work: Thue type problems for graphs, points, and numbers
cites work: Nonrepetitive colorings of graphs of bounded tree-width
cites work: Q3659988
cites work: Structural sparsity
cites work: The Mathematical Coloring Book
DOI: 10.1016/J.EJC.2015.05.013
Recommended article: Nonrepetitive colorings of graphs
Recommended article: Q3576675
Recommended article: Nonrepetitive and pattern-free colorings of the plane
Recommended article: A note on coloring line arrangements
Recommended article: Nonrepetitive graph colouring
Recommended article: Nonrepetitive vertex colorings of graphs
Recommended article: Q3424780
Recommended article: Nonrepetitive colorings of graphs -- a survey
description: scientific article; zbMATH DE number 6487472