Abstract
Let G be a plane graph with maximum face size Δ ∗ . If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with Δ ∗ + 1 colors, i.e., a coloring such that all vertices incident with the same face receive distinct colors.
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.
