Planar graphs have bounded nonrepetitive chromatic number
From MaRDI portal
Publication:5126756
DOI10.19086/aic.12100zbMath1450.05012arXiv1904.05269MaRDI QIDQ5126756
Louis Esperet, David R. Wood, Bartosz Walczak, Vida Dujmović, Gwenaël Joret
Publication date: 20 October 2020
Published in: Advances in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.05269
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
05C83: Graph minors