The last excluded case of Dirac's map‐color theorem for choosability

DOI10.1002/jgt.20136zbMath1094.05026DBLPjournals/jgt/KralS06OpenAlexW4256591804WikidataQ57601539 ScholiaQ57601539MaRDI QIDQ5469029

Riste Škrekovski, Daniel Král'

Publication date: 16 May 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20136

zbMATH Keywords

graph coloringlist coloringgraphs on surfacesDirac's map-color theoremHeawood's formula

Mathematics Subject Classification ID

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

Related Items (4)

The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ Beyond degree choosability ⋮ Degree choosable signed graphs ⋮ Critically paintable, choosable or colorable graphs

Cites Work

• Unnamed Item
• Short Proof of a Map-Colour Theorem
• Graph colorings with local constraints -- a survey
• A Six Color Problem
• Generalized list colourings of graphs
• A Brooks-Type Theorem for the Generalized List T-Coloring

This page was built for publication: The last excluded case of Dirac's map‐color theorem for choosability