Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Runrun Liu, Xiangwen Li. Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discrete Mathematics, 342(3):623-627, 2019. [doi]

Abstract

Abstract is missing.