A note about online nonrepetitive coloring k-trees
Abstract
We prove that it is always possible to color online nonrepetitively any (partial) k-tree (that is, graphs with tree-width at most k) with 4k colors. This implies that it is always possible to color online nonrepetitively cycles, trees and series-parallel graphs with 16 colors. Our results generalize the respective (offline) nonrepetitive coloring results.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.