Add to ORKGA colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive colourings with a bounded number of colours, thus proving a conjecture of Alon, Grytczuk, Haluszczak and Riordan (2002). We also generalise this result for graphs of bounded Euler genus, graphs excluding a fixed minor, and graphs excluding a fixed topological minor
AbstractWe define k-diverse colouring of a graph to be a proper vertex colouring in which every vert...
Reverse mathematics is primarily interested in what set existence axioms are necessary in a proof of...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
International audienceA colouring of a graph is "nonrepetitive" if for every path of even order, the...
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 for which the first half of the p...
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More g...
A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the p...
The following seemingly simple question with surprisingly many connections to various problems in co...
A vertex coloring of a graph $G$ is $k \textit{-nonrepetitive}$ if one cannot find a periodic sequen...
A sequence S = s1s2:::s2n is called a repetition if si = sn+i for each i = 1;:::; n. A coloring of t...
We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and o...
A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the ...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe define k-diverse colouring of a graph to be a proper vertex colouring in which every vert...
Reverse mathematics is primarily interested in what set existence axioms are necessary in a proof of...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
International audienceA colouring of a graph is "nonrepetitive" if for every path of even order, the...
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 for which the first half of the p...
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More g...
A vertex colouring of a graph is nonrepetitive if there is no path for which the first half of the p...
The following seemingly simple question with surprisingly many connections to various problems in co...
A vertex coloring of a graph $G$ is $k \textit{-nonrepetitive}$ if one cannot find a periodic sequen...
A sequence S = s1s2:::s2n is called a repetition if si = sn+i for each i = 1;:::; n. A coloring of t...
We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and o...
A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the ...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...
AbstractWe define k-diverse colouring of a graph to be a proper vertex colouring in which every vert...
Reverse mathematics is primarily interested in what set existence axioms are necessary in a proof of...
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the sam...