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

Runrun Liu Xiangwen Li

Published in: Discret. Math. (2019)

Keyphrases

planar graphs
dynamic programming
minimum weight