On 3-choosable planar graphs of girth at least 4

Let GG be a plane graph of girth at least 4. Two cycles of GG are intersecting if they have at least one vertex in common. In this paper, we show that if a plane graph GG has neither intersecting 4-cycles nor a 5-cycle intersecting with any 4-cycle, then GG is 3-choosable, which extends one of Thomassen’s results [C. Thomassen, 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser. B 64 (1995) 101–107].