Nonrepetitive Colorings of GraphsA Survey
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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2007-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2007/74639 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832555421676601344 |
|---|---|
| author | Jaroslaw Grytczuk |
| author_facet | Jaroslaw Grytczuk |
| author_sort | Jaroslaw Grytczuk |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-56f8ad20a3ee4c92869a0a6a1b9b319a |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 2007-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-56f8ad20a3ee4c92869a0a6a1b9b319a2025-02-03T05:48:16ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04252007-01-01200710.1155/2007/7463974639Nonrepetitive Colorings of GraphsA SurveyJaroslaw Grytczuk0Algorithmics Research Group, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków 30-387, PolandA 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.http://dx.doi.org/10.1155/2007/74639 |
| spellingShingle | Jaroslaw Grytczuk Nonrepetitive Colorings of GraphsA Survey International Journal of Mathematics and Mathematical Sciences |
| title | Nonrepetitive Colorings of GraphsA Survey |
| title_full | Nonrepetitive Colorings of GraphsA Survey |
| title_fullStr | Nonrepetitive Colorings of GraphsA Survey |
| title_full_unstemmed | Nonrepetitive Colorings of GraphsA Survey |
| title_short | Nonrepetitive Colorings of GraphsA Survey |
| title_sort | nonrepetitive colorings of graphsa survey |
| url | http://dx.doi.org/10.1155/2007/74639 |
| work_keys_str_mv | AT jaroslawgrytczuk nonrepetitivecoloringsofgraphsasurvey |