Skip to main navigation Skip to search Skip to main content

The complexity of nonrepetitive coloring

  • Budapest University of Technology and Econonomics

Research output: Contribution to journal › Article › peer-review

Original languageEnglish
Pages (from-to)13-18
Number of pages6
JournalDiscrete Applied Mathematics
Volume157
Issue number1
DOIs
StatePublished - Jan 6 2009

ASJC Scopus Subject Areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Keywords

  • Complexity
  • Nonrepetitive coloring
  • Polynomial hierarchy
  • Thue chromatic number

Cite this