Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours

zbMath1266.05029arXiv1202.1569MaRDI QIDQ1953438

David R. Wood, Gwenaël Joret, Fabrizio Frati, Vida Dujmović

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.1569

zbMATH Keywords

nonrepetitive graph colouring

Mathematics Subject Classification ID

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

Related Items (7)

Layered separators in minor-closed graph classes with applications ⋮ New bounds for facial nonrepetitive colouring ⋮ Stack and Queue Layouts via Layered Separators ⋮ Graph layouts via layered separators ⋮ Nonrepetitive colorings of line arrangements ⋮ Pathwidth and nonrepetitive list coloring ⋮ Every plane graph is facially-non-repetitively \(C\)-choosable

This page was built for publication: Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours