A note on not-4-list colorable planar graphs

zbMath1388.05048MaRDI QIDQ1640221

Margit Voigt, Arnfried Kemnitz

Publication date: 14 June 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/v25i2p46

zbMATH Keywords

planar graphlist colouring

Mathematics Subject Classification ID

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

Related Items (6)

Chromatic λ‐choosable and λ‐paintable graphs ⋮ List 4-colouring of planar graphs ⋮ Refined List Version of Hadwiger’s Conjecture ⋮ A refinement of choosability of graphs ⋮ Circular chromatic number of signed graphs ⋮ Complex and homomorphic chromatic number of signed planar simple graphs

Cites Work

• Unnamed Item
• List colourings of planar graphs
• Every planar graph is 5-choosable
• Complexity of choosing subsets from color sets
• On \(t\)-common list-colorings
• Note on a paper of B. Grünbaum on acyclic colorings
• Every Planar Map is Four Colorable
• Brooks-type theorems for choosability with separation

This page was built for publication: A note on not-4-list colorable planar graphs