Abstract
In [D. Král’, T. Madaras, R. Škrekovski, Cyclic, diagonal and facial colorings, European J. Combin. 26 (2005) 473–490], we established that every planar graph has a coloring with eight colors such that no two vertices joined by a facial walk of length one or two receive the same color. It turned out that the analysis of one of the cases in our proof is incomplete. We provide a completed analysis in this note.
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.
