| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652871 | Electronic Notes in Discrete Mathematics | 2007 | 7 Pages |
Abstract
A coloring of the vertices of a graph G is nonrepetitive if there is no even path in G whose first half looks the same as the second half. This notion arose as an analogue of the famous nonrepetitive sequences of Thue. We consider here the list analogue and the game analogue of nonrepetitive colorings.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
