The complexity of nonrepetitive coloring
type: Item
instance of: scholarly article
title: The complexity of nonrepetitive coloring
zbMATH Open document ID: 1188.05066
author: Dániel Marx
author: Marcus Schaefer
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5523211
zbMATH Keywords: nonrepetitive coloring
zbMATH Keywords: thue chromatic number
zbMATH Keywords: polynomial hierarchy
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.dam.2008.04.015
OpenAlex ID: W1976058117
cites work: Nonrepetitive colorings of graphs
cites work: Color-coding
cites work: Notes on nonrepetitive graph colouring
cites work: Estimation of sparse hessian matrices and graph coloring problems
cites work: Pattern avoidance: themes and variations
cites work: Q4217593
cites work: Parametrized complexity theory.
cites work: Thue type problems for graphs, points, and numbers
cites work: Q3424780
cites work: Q4529547
cites work: Star chromatic number
DOI: 10.1016/J.DAM.2008.04.015
description: scientific article; zbMATH DE number 5523211