The following publications are possibly variants of this publication:
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9Jie Hu, Guanghui Wang, Jianliang Wu, Donglei Yang, Xiaowei Yu. DM, 342(5):1392-1402, 2019. [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]
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10Yulin Chang, Qiancheng Ouyang, Guanghui Wang. jco, 38(1):185-196, 2019. [doi]
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11Xiaohan Cheng, Bin Wang, Jihui Wang. DAM, 313:29-39, 2022. [doi]
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least sixYuehua Bu, Ko-Wei Lih, Weifan Wang. dmgt, 31(3):429-439, 2011. [doi]
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degreeWeifan Wang, Yiqiao Wang 0002. jco, 19(4):471-485, 2010. [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]