Sciweavers

DM
2008
110views more  DM 2008»
14 years 19 days ago
Nonrepetitive colorings of graphs of bounded tree-width
A sequence of the form s1s2 . . . sms1s2 . . . sm is called a repetition. A vertex-coloring of a graph is called nonrepetitive if none of its paths is repetitively colored. We ans...
André Kündgen, Michael J. Pelsmajer