Abstract
The1999 Academic Pressentire chromatic number χCopyright vef(G) of a plane graphGis the least number of colors assigned to the vertices, edges and faces so that every two adjacent or incident pair of them receive different colors. Kronk and Mitchem (1973) conjectured that χvef(G)≤ Δ+4 for every plane graphG. In this paper we prove the conjecture for a plane graphGhaving χ′(G)=Δ and give a upper bound χvef(G) ≤ Δ+5 for all plane graphs, where χ′(G) and Δ are the chromatic index and the maximum degree ofG, respectively.
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.
