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]
@article{DaiWX17,
title = {Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable},
author = {Lifeng Dai and Yingqian Wang and Jinghan Xu},
year = {2017},
doi = {10.1016/j.disc.2017.04.006},
url = {https://doi.org/10.1016/j.disc.2017.04.006},
researchr = {https://researchr.org/publication/DaiWX17},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {340},
number = {9},
pages = {2108-2122},
}