Nonrepetitive colorings of graphs |
| |
| Institution: | 1. School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China;2. Center for Mathematics and Interdisciplinary Sciences of Qinghai Province, Xining, Qinghai 810008, China |
| |
| 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: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
