Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable

Lingji Xu, Zhengke Miao, Yingqian Wang. Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. J. Comb. Optim., 28(4):774-786, 2014. [doi]

Abstract

Abstract is missing.