  DP-coloring (also known as correspondence coloring) of a simple graph is a
generalization of list coloring. It is known that planar graphs without
4-cycles adjacent to triangles are 4-choosable, and planar graphs without
4-cycles are DP-4-colorable. In this paper, we show that planar graphs without
4-cycles adjacent to triangles are DP-4-colorable, which is an extension of the
two results above.
