Key points are not available for this paper at this time.
Abstract This paper proves that every planar graph having no cycle of length 4, 7, or 9 is DP‐3‐colorable.
Kang et al. (Wed,) studied this question.