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]
@article{XuMW14-0,
title = {Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable},
author = {Lingji Xu and Zhengke Miao and Yingqian Wang},
year = {2014},
doi = {10.1007/s10878-012-9586-4},
url = {http://dx.doi.org/10.1007/s10878-012-9586-4},
researchr = {https://researchr.org/publication/XuMW14-0},
cites = {0},
citedby = {0},
journal = {J. Comb. Optim.},
volume = {28},
number = {4},
pages = {774-786},
}