The following publications are possibly variants of this publication:
- Total coloring of planar graphs with maximum degree 7Bing Wang, Jian-Liang Wu. ipl, 111(20):1019-1021, 2011. [doi]
- Minimum total coloring of planar graphs with maximum degree 8Liting Wang, Huijuan Wang, Weili Wu. jco, 45(2):82, March 2023. [doi]
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8Yulin Chang, Jie Hu, Guanghui Wang, Xiaowei Yu. DM, 343(10):112014, 2020. [doi]
- Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8Jian Chang, Jian-Liang Wu, Hui-Juan Wang, Zhan-Hai Guo. combinatorics, 21(1):1, 2014. [doi]
- List edge and list total coloring of planar graphs with maximum degree 8Huijuan Wang, Bin Liu, Xin Zhang, Lidong Wu, Weili Wu, Hongwei Gao. jco, 32(1):188-197, 2016. [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]
- 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]
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting trianglesLan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih. appml, 22(9):1369-1373, 2009. [doi]
- 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 chromatic number of planar graphs with maximum degree tenWeifan Wang. jgt, 54(2):91-102, 2007. [doi]