The following publications are possibly variants of this publication:
- (1, 0, 0)-colorability of planar graphs without cycles of length 4, 5 or 9Yingqian Wang, Yaochou Yang. DM, 326:44-49, 2014. [doi]
- Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorableLingji Xu, Zhengke Miao, Yingqian Wang. jco, 28(4):774-786, 2014. [doi]
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosableYingqian Wang, Qian Wu, Liang Shen. DAM, 159(4):232-239, 2011. [doi]
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosableYingqian Wang, Huajing Lu, Ming Chen. DM, 310(1):147-158, 2010. [doi]
- Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorableChuanni Zhang, Yingqian Wang, Min Chen. DM, 339(12):3032-3042, 2016. [doi]
- (1, 0, 0)-Colorability of planar graphs without prescribed short cyclesYuehua Bu, Jinghan Xu, Yingqian Wang. jco, 30(3):627-646, 2015. [doi]
- Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorableOwen Hill, Diana Smith, Yingqian Wang, Lingji Xu, Gexin Yu. DM, 313(20):2312-2317, 2013. [doi]