Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs

DOI10.1016/j.jctb.2014.08.003zbMath1307.05076arXiv1402.1813OpenAlexW2098118748MaRDI QIDQ2259863

Robin Thomas, Luke Postle

Publication date: 5 March 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

planar graphchoosabilitylist coloring

Mathematics Subject Classification ID

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

Related Items (4)

Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two ⋮ The polynomial method for list-colouring extendability of outerplanar graphs

Cites Work

• Unnamed Item
• List colourings of planar graphs
• Exponentially many 5-list-colorings 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
• The four-colour theorem
• Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
• On list-coloring extendable outerplanar graphs
• Dirac's map-color theorem for choosability

This page was built for publication: Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs