The following publications are possibly variants of this publication:
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cyclesRui Li, Baogang Xu. DM, 311(20):2158-2163, 2011. [doi]
- Acyclic 5-choosability of planar graphs without 4-cyclesMin Chen, Weifan Wang. DM, 308(24):6216-6225, 2008. [doi]
- Planar graphs without 4-cycles are acyclically 6-choosableWeifan Wang, Min Chen. jgt, 61(4):307-323, 2009. [doi]
- Neighbor sum distinguishing total choosability of planar graphs without 4-cyclesJihui Wang, Jiansheng Cai, Qiaoling Ma. DAM, 206:215-219, 2016. [doi]
- Labelling planar graphs without 4-cycles with a condition on distance twoWeifan Wang, Leizhen Cai. DAM, 156(12):2241-2249, 2008. [doi]
- On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cyclesLan Shen, Yingqian Wang. gc, 25(3):401-407, 2009. [doi]
- Edge choosability of planar graphs without 5-cycles with a chordYongzhu Chen, Weiyi Zhu, Weifan Wang. DM, 309(8):2233-2238, 2009. [doi]
- Choosability and edge choosability of planar graphs without five cyclesWeifan Wang, Ko-Wei Lih. appml, 15(5):561-565, 2002. [doi]
- Choosability and Edge Choosability of Planar Graphs without Intersecting TrianglesWeifan Wang, Ko-Wei Lih. siamdm, 15(4):538-545, 2002. [doi]