Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Lam et al. proved that every planar graph without 4-cycles is 4-choosable (Lam et al., 1999). In this paper, we improve this result by showing that every planar graph without 4-cycles adjacent to triangles is 4-choosable.