Nonrepetitive colorings of graphs -- a survey (Q925326)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5282441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonrepetitive colorings of graphs -- a survey |
scientific article; zbMATH DE number 5282441 |
Statements
Nonrepetitive colorings of graphs -- a survey (English)
0 references
3 June 2008
0 references
Summary: A vertex coloring \(f\) of a graph \(G\) is nonrepetitive if there are no integer \(r\geq 1\) and a simple path \(\nu_1,\dots,\nu_{2r}\) in \(G\) such that \(f(\nu_i)= f(\nu_{r+i})\) for all \(i=1,\dots,r\). This notion is a graph-theoretic variant of nonrepetitive sequences of Thue. The paper surveys problems and results on this topic.
0 references
0.9330804944038392
0 references
0.9250969290733336
0 references
0.9118479490280152
0 references
0.8771281242370605
0 references
0.8739069104194641
0 references
