Planar graphs have bounded nonrepetitive chromatic number - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Advances in Combinatorics Année : 2020

Planar graphs have bounded nonrepetitive chromatic number

Résumé

A 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.

Dates et versions

hal-02165018 , version 1 (25-06-2019)

Identifiants

Citer

Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood. Planar graphs have bounded nonrepetitive chromatic number. Advances in Combinatorics, 2020, 5, pp.11. ⟨10.19086/aic.12100⟩. ⟨hal-02165018⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More