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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
