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]
- 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]
- Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorableLifeng Dai, Yingqian Wang, Jinghan Xu. DM, 340(9):2108-2122, 2017. [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]
- Improper colorability of planar graphs without prescribed short cyclesYingqian Wang, Jinghan Xu. DM, 322:5-14, 2014. [doi]
- On 3-colorable planar graphs without prescribed cyclesWeifan Wang, Min Chen. DM, 307(22):2820-2825, 2007. [doi]
- Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorableMing Chen, Yingqian Wang, Peipei Liu, Jinghan Xu. DM, 339(2):886-905, 2016. [doi]
- (1, 1, 0)-coloring of planar graphs without cycles of length 4 and 6Yuehua Bu, Caixia Fu. DM, 313(23):2737-2741, 2013. [doi]
- Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorableYingqian Wang, Jinghan Xu. ipl, 113(18):659-663, 2013. [doi]