Acyclic chromatic indices of planar graphs with large girth. - Weifan Wang 001; Qiaojun Shu; Kan Wang; Ping Wang 023 (Discret. Appl. Math., 2011)

Every 4-regular graph is acyclically edge-6-colorable - Weifan Wang 001; Qiaojun Shu; Yiqiao Wang 002 (CoRR, 2012)

Acyclic edge coloring of planar graphs without 5-cycles. - Qiaojun Shu; Weifan Wang 001; Yiqiao Wang 002 (Discret. Appl. Math., 2012)

Acyclic chromatic indices of planar graphs with girth at least five. - Qiaojun Shu; Weifan Wang 001 (J. Comb. Optim., 2012)

The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. - Yiqiao Wang 002; Qiaojun Shu; Weifan Wang 001 (Discret. Appl. Math., 2013)

Acyclic list edge coloring of outerplanar graphs. - Qiaojun Shu; Yiqiao Wang 002; Weifan Wang 001 (Discret. Math., 2013)

A new upper bound on the acyclic chromatic indices of planar graphs. - Weifan Wang 001; Qiaojun Shu; Yiqiao Wang 002 (Eur. J. Comb., 2013)

Acyclic edge coloring of planar graphs without 4-cycles. - Weifan Wang 001; Qiaojun Shu; Yiqiao Wang 002 (J. Comb. Optim., 2013)

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. - Qiaojun Shu; Weifan Wang 001; Yiqiao Wang 002 (J. Graph Theory, 2013)

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle. - Yiqiao Wang 002; Qiaojun Shu; Jian-Liang Wu 001; Wenwen Zhang (J. Comb. Optim., 2014)

(2, 1)-total labeling of trees with large maximum degree. - Dong Chen 012; Wai Chee Shiu; Qiaojun Shu; Pak Kiu Sun; Weifan Wang 001 (Discret. Appl. Math., 2015)

A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. - Zhengke Miao; Qiaojun Shu; Weifan Wang 001; Dong Chen 012 (J. Comb. Optim., 2016)

A new sufficient condition for a tree T to have the (2, 1)-total number Δ + 1. - Qiaojun Shu; Weifan Wang 001; Yiqiao Wang 002 (J. Comb. Optim., 2017)

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. - Qiaojun Shu; Guohui Lin; Eiji Miyano (CoRR, 2020)

Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. - Qiaojun Shu; Yong Chen 002; Shuguang Han; Guohui Lin; Eiji Miyano; An Zhang 001 (Theor. Comput. Sci., 2021)

Acyclically Edge Color Triangle-free Toroidal Graphs in $ varDelta + 2$ Colors. - Qiaojun Shu; Guohui Lin (COCOA (1), 2024)

Planar graphs are acyclically edge (Δ + 5)-colorable. - Qiaojun Shu; Guohui Lin (J. Comb. Optim., 2024)