Planar graphs without $ \{4, 6, 8\} $-cycles are 3-choosable
Yueying Zhao, Lianying Miao · AIMS Mathematics · 2021
In 2018, Dvořák and Postle introduced DP-coloring and proved that planar graphs without cycles of lengths 4 to 8 are 3-choosable. In this paper, we prove that planar graphs without $ \{4, 6, 8\} $-cycles are 3-choosable by using the technique developed in DP-coloring, which also extends the result of Wang and Chen [Sci. China Math., 50 (2007), 1552-1562].