Every plane graph is facially-non-repetitively \(C\)-choosable

zbMath1391.05108MaRDI QIDQ1753049

Grzegorz Gutowski

Publication date: 25 May 2018

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p74

zbMATH Keywords

planar graphsnon-repetitive colorings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the facial Thue choice number of plane graphs via entropy compression method
• Thue choosability of trees
• Pathwidth and nonrepetitive list coloring
• A unified approach to visibility representations of planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Every planar graph is 5-choosable
• Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours
• Facial Nonrepetitive Vertex Coloring of Plane Graphs
• Nonrepetitive colorings of graphs
• New approach to nonrepetitive sequences

This page was built for publication: Every plane graph is facially-non-repetitively \(C\)-choosable