Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable

Ligang Jin, Yingli Kang, Xuding Zhu

The concept of DP-coloring of graphs was introduced by Dvořák and Postle, and was used to prove that planar graphs without cycles of length from $4$ to $8$ are $3$-choosable. In th…