PLANE GRAPHS ARE ENTIRELY (Δ + 5)-CHOOSABLE

DOI10.1142/S1793830914500232zbMath1301.05125MaRDI QIDQ2875688

Xiaoxue Hu, Yi Qiao Wang

Publication date: 11 August 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

plane graphmaximum degreeentire choosabilitydischarging method

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

This page was built for publication: PLANE GRAPHS ARE ENTIRELY (Δ + 5)-CHOOSABLE