The following publications are possibly variants of this publication:
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorableDingzhu Du, Lan Shen, Yingqian Wang. DAM, 157(13):2778-2784, 2009. [doi]
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cyclesBing Wang, Jian-Liang Wu. DM, 311(18-19):2025-2030, 2011. [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]
- 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]
- Choosability and Edge Choosability of Planar Graphs without Intersecting TrianglesWeifan Wang, Ko-Wei Lih. siamdm, 15(4):538-545, 2002. [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]
- Vertex-arboricity of planar graphs without intersecting trianglesMin Chen, André Raspaud, Weifan Wang. ejc, 33(5):905-923, 2012. [doi]
- Total coloring of planar graphs with maximum degree 8Huijuan Wang, Lidong Wu, Jianliang Wu. TCS, 522:54-61, 2014. [doi]
- On acyclic edge coloring of planar graphs without intersecting trianglesPing Sheng, Yingqian Wang. DM, 311(21):2490-2495, 2011. [doi]