Nonrepetitive Colorings of Graphs -- A Survey

DMCA

Nonrepetitive Colorings of Graphs -- A Survey (2007)

Cached

Save to List
Add to Collection
Correct Errors
Monitor Changes

by Jarosław Grytczuk

Citations:

6 - 0 self

BibTeX

@MISC{Grytczuk07nonrepetitivecolorings,
    author = {Jarosław Grytczuk},
    title = { Nonrepetitive Colorings of Graphs -- A Survey},
    year = {2007}
}

OpenURL

Abstract

A vertex coloring f of a graph G is nonrepetitive if there are no integer r ≥ 1 and a simple path v1,...,v2r in G such that f (vi) = f (vr+i) for all i = 1,...,r. This notion is a graph-theoretic variant of nonrepetitive sequences of Thue. The paper surveys problems and results on this topic.

Keyphrases

graph survey review article nonrepetitive coloring nonrepetitive sequence creative common attribution license original work graph-theoretic variant jaros aw grytczuk paper survey problem unrestricted use open access article simple path v1