Add to ORKGA 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. Copyright © 2007 Jarosław Grytczuk. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More g...
A repetition is a sequence of symbols in which the first half is the same asthe second half. An edge...
A vertex colouring of a graph G is nonrepetitive if for any path P = (v1, v2,..., v2r) in G, the fir...
A vertex coloring f of a graph G is nonrepetitive if there are no integer r ≥ 1 and a simple path v1...
A sequence S = s1s2:::s2n is called a repetition if si = sn+i for each i = 1;:::; n. A coloring of t...
A coloring c of the vertices of a graph G is nonrepetitive if there exists no path v1v2... v2l for w...
AbstractA coloring of a graph is nonrepetitive if the graph contains no path that has a color patter...
International audienceA colouring of a graph is "nonrepetitive" if for every path of even order, the...
A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half rece...
A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the p...
A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the p...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the faci...
A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\ldo...
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More g...
A repetition is a sequence of symbols in which the first half is the same asthe second half. An edge...
A vertex colouring of a graph G is nonrepetitive if for any path P = (v1, v2,..., v2r) in G, the fir...
A vertex coloring f of a graph G is nonrepetitive if there are no integer r ≥ 1 and a simple path v1...
A sequence S = s1s2:::s2n is called a repetition if si = sn+i for each i = 1;:::; n. A coloring of t...
A coloring c of the vertices of a graph G is nonrepetitive if there exists no path v1v2... v2l for w...
AbstractA coloring of a graph is nonrepetitive if the graph contains no path that has a color patter...
International audienceA colouring of a graph is "nonrepetitive" if for every path of even order, the...
A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half rece...
A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the p...
A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the p...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the faci...
A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\ldo...
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More g...
A repetition is a sequence of symbols in which the first half is the same asthe second half. An edge...
A vertex colouring of a graph G is nonrepetitive if for any path P = (v1, v2,..., v2r) in G, the fir...