Planar graphs without chordal 6-cycles are 4-choosable

A graph G is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. In this paper, we prove that every planar graph without chordal 6-cycles is 4-choosable. This extends a known result that every planar graph without 6-cycles is 4-choosable.