Nonrepetitive Colorings of Graphs—A Survey

Jaroslaw Grytczuk

International Journal of Mathematics and Mathematical Sciences, 2007, vol. 2007, 1-10

Abstract:

A vertex coloring f of a graph G is nonrepetitive if there are no integer r ≥ 1 and a simple path v 1 , … , v 2 r in G such that f ( v i ) = f ( v r + 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.

Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2007/074639.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2007/074639.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:074639

DOI: 10.1155/2007/74639

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().