A note on entire choosability of plane graphs

DOI10.1016/J.DAM.2011.12.014zbMath1242.05065OpenAlexW2030014657MaRDI QIDQ423943

Wei Dong

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.014

zbMATH Keywords

plane graphlist coloringentire coloring

Mathematics Subject Classification ID

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

Related Items (2)

The entire choosability of plane graphs ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable

Cites Work

• Unnamed Item
• Entire colouring of plane graphs
• A seven-color theorem on the sphere
• On the Entire Coloring Conjecture
• Coupled choosability of plane graphs
• The entire chromatic number of a normal graph is at most seven

This page was built for publication: A note on entire choosability of plane graphs