Planar graphs without triangular $4$-cycles are $3$-choosable

It is known that not all planar graphs are $4$-choosable (Margit Voigt, 1993), but those without $4$-cycles are $4$-choosable (Lam, Xu and Liu, 1999). We prove that all planar graphs without $4$-cycles adjacent to $3$-cycles are $4$-choosable.