Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. - Lifeng Dai; Yingqian Wang 001; Jinghan Xu (Discret. Math., 2017)