A note about online nonrepetitive coloring $k$-trees
Combinatorics
2019-09-09 v1
Abstract
We prove that it is always possible to color online nonrepetitively any (partial) -tree (that is, graphs with tree-width at most ) with colors. This implies that it is always possible to color online nonrepetitively cycles, trees and series-parallel graphs with colors. Our results generalize the respective (offline) nonrepetitive coloring results.
Cite
@article{arxiv.1909.02612,
title = {A note about online nonrepetitive coloring $k$-trees},
author = {Balázs Keszegh and Xuding Zhu},
journal= {arXiv preprint arXiv:1909.02612},
year = {2019}
}