The entire choosability of plane graphs

DOI10.1007/S10878-014-9819-9zbMath1336.05035OpenAlexW2083424280MaRDI QIDQ266053

Tingting Wu, Xiaoxue Hu, Yi Qiao Wang, Wei Fan Wang

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9819-9

zbMATH Keywords

plane graphmaximum degreeentire choosability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)

Related Items (1)

Plane graphs with maximum degree 9 are entirely 11-choosable

Cites Work

• 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
• Simultaneous coloring of edges and faces of plane graphs
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• On the colorings of outerplanar graphs
• Colorings of plane graphs: a survey
• The edge-face choosability of plane graphs with maximum degree at least 9
• A seven-color theorem on the sphere
• The entire coloring of series-parallel graphs
• PLANE GRAPHS ARE ENTIRELY (Δ + 5)-CHOOSABLE
• On the Entire Coloring Conjecture
• Structural theorem on plane graphs with application to the entire coloring number
• A new proof of the 6 color theorem
• 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
• Unnamed Item

This page was built for publication: The entire choosability of plane graphs