Title of article
Nonrepetitive colorings of graphs
Author/Authors
Czerwi?ski، نويسنده , , Sebastian and Grytczuk، نويسنده , , Jarek، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
7
From page
453
To page
459
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.
Keywords
Nonrepetitive coloring , Thue sequences , game coloring number , list coloring
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454623
Link To Document