DP-3-coloring of some planar graphs

Abstract

In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.

15 pages, five figures. We revised the previous version based on referees' report

References in corpus (4)

• The asymptotic behavior of the correspondence chromatic number
• DP-colorings of graphs with high chromatic number
• Sharp Dirac's Theorem for DP-Critical Graphs
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable

Cited by in corpus (4)

• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$
• Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable