Yingqian Wang, Ming Chen, Liang Shen. Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable. Discrete Mathematics, 308(17):4014-4017, 2008. [doi]
@article{WangCS08:0,
title = {Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable},
author = {Yingqian Wang and Ming Chen and Liang Shen},
year = {2008},
doi = {10.1016/j.disc.2007.07.099},
url = {http://dx.doi.org/10.1016/j.disc.2007.07.099},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/WangCS08%3A0},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {308},
number = {17},
pages = {4014-4017},
}