Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable

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]

Authors

Yingqian Wang

This author has not been identified. Look up 'Yingqian Wang' in Google

Ming Chen

This author has not been identified. Look up 'Ming Chen' in Google

Liang Shen

This author has not been identified. Look up 'Liang Shen' in Google