Abstract
A cyclic coloring is a vertex coloring such that vertices in a face receive different colors. Let Δ be the maximum face degree of a graph. This article shows that plane graphs have cyclic 9 5 Δ -colorings, improving results of Ore and Plummer, and of Borodin. The result is mainly a corollary of a best-possible upper bound on the minimum cyclic degree of a vertex of a plane graph in terms of its maximum face degree. The proof also yields results on the projective plane, as well as for d-diagonal colorings. Also, it is shown that plane graphs with Δ=5 have cyclic 8-colorings. This result and also the 9 5 Δ result are not necessarily best possible.
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.
