Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles

Shu Fang, Runrun Liu, Gexin Yu

Graph coloring with preferences offers a powerful framework for constraint satisfaction problems in which fulfilling every request is impossible but satisfying a guaranteed positiv…