Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable

Lifeng Dai, Yingqian Wang, Jinghan Xu. Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. Discrete Mathematics, 340(9):2108-2122, 2017. [doi]

Abstract

Abstract is missing.