Acyclic choosability of IC-planar graphs

A proper vertex-coloring of a graph $G$ is acyclic if $G$ contains no bicolored cycles. A graph $G$ is acyclically $k$-choosable if for each list assignment $L=\text{{}L\left(v\right)\mid v\in V\left(G\right)$ with $\left|L\left(v\right)\right|\ge k\text{}}$, there exists a proper acyclic vertex-coloring $\varphi$ of $G$ such that $\varphi \left(v\right)\in L\left(v\right)$ for all vertices $v\in V\left(G\right)$. In this paper we prove that every IC-planar graph is acyclically 12-choosable.