Plane graphs with maximum degree 9 are entirely 11-choosable

DOI10.1016/j.disc.2016.05.015zbMath1339.05074OpenAlexW2417377661MaRDI QIDQ2629286

Wai Chee Shiu, Xiaoxue Hu, Wei Fan Wang, Yi Qiao Wang

Publication date: 5 July 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.05.015

zbMATH Keywords

plane graphmaximum degreeentire choosability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The entire choosability of plane graphs
• A note on entire choosability of plane graphs
• Entire colouring of plane graphs
• Entire choosability of near-outerplane graphs
• Upper bounds of entire chromatic number of plane graphs
• The complete chromatic number of some planar graphs
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• On the colorings of outerplanar graphs
• A seven-color theorem on the sphere
• PLANE GRAPHS ARE ENTIRELY (Δ + 5)-CHOOSABLE
• On the Entire Coloring Conjecture
• Structural theorem on plane graphs with application to the entire coloring number
• Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
• Plane Graphs with Maximum Degree Are Entirely ‐Colorable
• The entire chromatic number of a normal graph is at most seven

This page was built for publication: Plane graphs with maximum degree 9 are entirely 11-choosable