Acyclic 4-choosability of planar graphs without intersecting short cycles

A proper vertex coloring of G is acyclic if G contains no bicolored cycle. Namely, every cycle of G must be colored with at least three colors. G is acyclically L-colorable if for a given list assignment L = {L(v) : v is an element of V}, there exists an acyclic coloring pi of G such that p(v). L(v) for all v is an element of V. If G is acyclically L-colorable for any list assignment with vertical bar L(v)vertical bar >= k for all v is an element of V, then G is acyclically k-choosable. In this paper, we prove that planar graphs without intersecting 5(-)-cycles are acyclically 4-choosable. This provides a sufficient condition for planar graphs to be acyclically 4-choosable and also strengthens a result in [M. Montassier, A. Raspaud and W. Wang, Acyclic 4-choosability of planar graphs without cycles of specific lengths, in Topics in Discrete Mathematics, Algorithms and Combinatorics, Vol. 26 (Springer, Berlin, 2006), pp. 473-491] which says that planar graphs without 4-, 5-cycles and intersecting 3-cycles are acyclically 4-choosable.