Planar graphs have bounded nonrepetitive chromatic number

DOI10.19086/aic.12100zbMath1450.05012arXiv1904.05269OpenAlexW3103615163MaRDI QIDQ5126756

Louis Esperet, David R. Wood, Gwenaël Joret, Bartosz Walczak, Vida Dujmović

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

zbMATH Keywords

graph minorgraphs of bounded Euler genus

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (17)

Clustered 3-colouring graphs of bounded degree ⋮ An improved planar graph product structure theorem ⋮ A fast algorithm for the product structure of planar graphs ⋮ Avoiding squares over words with lists of size three amongst four symbols ⋮ Separating layered treewidth and row treewidth ⋮ Improved product structure for graphs on surfaces ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ The product structure of squaregraphs ⋮ A note about online nonrepetitive coloring \(k\)-trees ⋮ Graph product structure for non-minor-closed classes ⋮ Extensions and reductions of squarefree words ⋮ Brief Announcement: Local Problems in the SUPPORTED Model ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Two Results on Layered Pathwidth and Linear Layouts ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ The weak circular repetition threshold over large alphabets

This page was built for publication: Planar graphs have bounded nonrepetitive chromatic number