Abstract
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle (2017). Kim and Ozeki proved that planar graphs without k-cycles where k=3,4,5, or 6 are DP-4-colorable. In this paper, we prove that every planar graph G without k-cycles adjacent to triangles is DP-4-colorable for k=5,6, which implies that every planar graph G without k-cycles adjacent to triangles is 4-choosable for k=5,6. This extends the result of Kim and Ozeki on 3-, 5-, and 6-cycles.
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.
