Nonrepetitive colorings of trees
type: Item
instance of: scholarly article
title: Nonrepetitive colorings of trees
zbMATH Open document ID: 1106.68089
author: N. E. Zubov
published in: Discrete Mathematics
publication date: 2007-02-13T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 11B83
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5124982
zbMATH Keywords: combinatorics on words
zbMATH Keywords: nonrepetitive sequence
zbMATH Keywords: Thue chromatic number
zbMATH Keywords: tree
zbMATH Keywords: palindrome
MaRDI profile type: Publication
full work available at URL: j.disc.2006.06.017
OpenAlex ID: W2134954492
cites work: Automatic Sequences
cites work: Nonrepetitive colorings of graphs
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: On square-free vertex colorings of graphs
cites work: Avoidable patterns in strings of symbols
cites work: Q3395963
cites work: Q4714446
cites work: Sharp characterizations of squarefree morphisms
cites work: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
cites work: The fixing block method in combinatorics on words
cites work: Q3424780
cites work: Q3659988
cites work: Q4529547
cites work: Aperiodic words on three symbols.
cites work: Q5186754
DOI: 10.1016/J.DISC.2006.06.017
description: scientific article; zbMATH DE number 5124982