Nonrepetitive colourings of graphs excluding a fixed immersion or topological minor
Combinatorics
2019-07-15 v3
Abstract
We prove that graphs excluding a fixed immersion have bounded nonrepetitive chromatic number. More generally, we prove that if is a fixed planar graph that has a planar embedding with all the vertices with degree at least 4 on a single face, then graphs excluding as a topological minor have bounded nonrepetitive chromatic number. This is the largest class of graphs known to have bounded nonrepetitive chromatic number.
Keywords
Cite
@article{arxiv.1701.07425,
title = {Nonrepetitive colourings of graphs excluding a fixed immersion or topological minor},
author = {Paul Wollan and David R. Wood},
journal= {arXiv preprint arXiv:1701.07425},
year = {2019}
}