Total Coloring of Series-Parallel Graphs. - Jian-Liang Wu 001; Daiqiang Hu (Ars Comb., 2004)

Planar graphs without intersecting 5-cycles are 4-choosable. - Daiqiang Hu; Jian-Liang Wu 001 (Discret. Math., 2017)

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs. - Daiqiang Hu; Jian-Liang Wu 001; Donglei Yang; Xin Zhang 017 (Graphs Comb., 2017)

Planar graphs without chordal 6-cycles are 4-choosable. - Daiqiang Hu; Danjun Huang; Weifan Wang 001; Jian-Liang Wu 001 (Discret. Appl. Math., 2018)