The following publications are possibly variants of this publication:
- Labelling planar graphs without 4-cycles with a condition on distance twoWeifan Wang, Leizhen Cai. DAM, 156(12):2241-2249, 2008. [doi]
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosableDeqiang Wang, Yu-Peng Wen, Kelun Wang. ipl, 108(3):87-89, 2008. [doi]
- Planar graphs without 4- and 5-cycles are acyclically 4-choosableMin Chen, André Raspaud. DAM, 161(7-8):921-931, 2013. [doi]
- Edge choosability of planar graphs without 5-cycles with a chordYongzhu Chen, Weiyi Zhu, Weifan Wang. DM, 309(8):2233-2238, 2009. [doi]
- Labeling Planar Graphs with Conditions on Girth and Distance TwoWeifan Wang, Ko-Wei Lih. siamdm, 17(2):264-275, 2003. [doi]
- The r-dynamic chromatic number of planar graphs without 4-, 5-cyclesRuiying Yang, Yuehua Bu, Junlei Zhu, Hongguo Zhu. jco, 45(1):47, 2023. [doi]
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorableLan Shen, Yingqian Wang. DM, 310(17-18):2372-2379, 2010. [doi]
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chordsJian Chang, Hui-Juan Wang, Jian-Liang Wu, Yong-Ga A. TCS, 476:16-23, 2013. [doi]