Entire coloring of plane graph with maximum degree eleven

A plane graph is called entirely k-colorable if for each x is an element of V (G) boolean OR E(G) boolean OR F(G), we can use k colors to assign each element x a color such that any two elements that are adjacent or incident receive distinct colors. In this paper, we prove that if G is a plane graph with Delta = 11, then G is entirely (Delta+2)-colorable, which provides a positive answer to a problem posed by Borodin (Problem 5.2 in Borodin (2013)). (C) 2014 Elsevier B.V. All rights reserved.