Entire coloring of plane graph with maximum degree eleven

DOI10.1016/J.DISC.2014.07.022zbMath1300.05095OpenAlexW2130395339MaRDI QIDQ740657

Wei Dong, Wensong Lin

Publication date: 4 September 2014

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

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

zbMATH Keywords

plane graphmaximum degreeentire coloring

Mathematics Subject Classification ID

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

Related Items (1)

Plane graphs with \(\Delta = 7\) are entirely 10-colorable

Cites Work

• Entire colouring of plane graphs
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• Colorings of plane graphs: a survey
• A seven-color theorem on the sphere
• Entire \((\varDelta +2)\)-colorability of plane graphs
• On the Entire Coloring Conjecture
• 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: Entire coloring of plane graph with maximum degree eleven