The following publications are possibly variants of this publication:
- Planar graphs without chordal 6-cycles are 4-choosableDaiqiang Hu, Danjun Huang, Weifan Wang, Jian-Liang Wu. DAM, 244:116-123, 2018. [doi]
- Total colorings of planar graphs without chordal 6-cyclesBing Wang, Jian-Liang Wu, Huijuan Wang. DAM, 171:116-121, 2014. [doi]
- Planar graphs without 5-cycles or without 6-cyclesQin Ma, Jian-Liang Wu, Xiao Yu. DM, 309(10):2998-3005, 2009. [doi]
- Total coloring of planar graphs without 6-cyclesJianfeng Hou, Bin Liu 0009, Guizhen Liu, Jianliang Wu. DAM, 159(2-3):157-163, 2011. [doi]
- Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-CyclesAijun Dong, Jianliang Wu. dmtcs, 21(3), 2019. [doi]
- List-edge-coloring of planar graphs without 6-cycles with three chordsHaiying Wang, Jianliang Wu. jco, 35(2):555-562, 2018. [doi]
- List edge coloring of planar graphs without 6-cycles with two chordsLinna Hu, Lei Sun, Jian-Liang Wu. dmgt, 41(1):199-211, 2021. [doi]
- Total coloring of planar graphs without adjacent chordal 6-cyclesHuijuan Wang, Bin Liu, Xiaoli Wang, Guangmo Tong, Weili Wu, Hongwei Gao. jco, 34(1):257-265, 2017. [doi]
- List linear arboricity of planar graphsXinhui An, Baoyindureng Wu. dmgt, 29(3):499-510, 2009. [doi]