Plane Graphs with Maximum Degree Are Entirely ‐Colorable

DOI10.1002/jgt.21676zbMath1269.05042MaRDI QIDQ5325942

Xiang Hua Mao, Ying Qian Wang, Zheng-Ke Miao

Publication date: 31 July 2013

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

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

zbMATH Keywords

plane graph; maximum degree; discharging method; entire coloring

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

The entire choosability of plane graphs, Entire coloring of plane graph with maximum degree eleven, Plane graphs with \(\Delta = 7\) are entirely 10-colorable, The entire chromatic number of graphs embedded on the torus with large maximum degree, Plane graphs with maximum degree 9 are entirely 11-choosable, Entire \((\varDelta +2)\)-colorability of plane graphs, Entire coloring of 2-connected plane graphs

Cites Work

• Entire colouring of plane graphs
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• A seven-color theorem on the sphere
• On the total coloring of planar graphs.
• On the Entire Coloring Conjecture
• Structural theorem on plane graphs with application to the entire coloring number
• The entire chromatic number of a normal graph is at most seven