(2, 1)-Total labelling of outerplanar graphs. - Dong Chen 012; Weifan Wang 001 (Discret. Appl. Math., 2007)

Injective coloring of planar graphs. - Yuehua Bu; Dong Chen 012; André Raspaud; Weifan Wang 001 (Discret. Appl. Math., 2009)

(2, 1)-Total labelling of trees with sparse vertices of maximum degree. - Jing Huang; Haina Sun; Weifan Wang 001; Dong Chen 012 (Inf. Process. Lett., 2009)

(2, 1)-Total number of trees with maximum degree three. - Weifan Wang 001; Dong Chen 012 (Inf. Process. Lett., 2009)

Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five. - Chengchao Yan; Danjun Huang; Dong Chen 012; Weifan Wang 001 (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)

Acyclic 4-choosability of planar graphs without intersecting short cycles. - Yingcai Sun; Min Chen 012; Dong Chen 012 (Discret. Math. Algorithms Appl., 2018)

(1, 0)-Relaxed strong edge list coloring of planar graphs with girth 6. - Kai Lin; Min Chen 012; Dong Chen 012 (Discret. Math. Algorithms Appl., 2019)

Vertex-arboricity of toroidal graphs without K5- and 6-cycles. - Aina Zhu; Dong Chen 012; Min Chen 012; Weifan Wang 001 (Discret. Appl. Math., 2022)