Abstract

The entire chromatic number χvef(G) of a plane graph G is the least number of colors such that any two adjacent or incident elements in V(G)∪E(G)∪F(G) receive different colors. In this paper, we prove that every 2-connected simple plane graph G with maximum degree Δ≥20 has χvef(G)=Δ+1.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call