Neighbor sum distinguishing total colorings of planar graphs. - Hualong Li; Laihao Ding; Bingqiang Liu; Guanghui Wang 002 (J. Comb. Optim., 2015)

Neighbor Sum Distinguishing Index of K4-Minor Free Graphs. - Jianghua Zhang; Laihao Ding; Guanghui Wang 002; Guiying Yan; Shan Zhou (Graphs Comb., 2016)

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. - Laihao Ding; Guanghui Wang 002; Jianliang Wu 001; Jiguo Yu (Graphs Comb., 2017)

Generalized acyclic edge colorings via entropy compression. - Laihao Ding; Guanghui Wang 002; Jianliang Wu 001 (J. Comb. Optim., 2018)

Graphs are (1, Δ+1)-choosable. - Laihao Ding; Guan-Huei Duh; Guanghui Wang 002; Tsai-Lien Wong; Jianliang Wu 001; Xiaowei Yu; Xuding Zhu (Discret. Math., 2019)

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. - Xiaohan Cheng; Laihao Ding; Guanghui Wang 002; Jianliang Wu 001 (Discret. Math., 2020)

Properly colored short cycles in edge-colored graphs. - Laihao Ding; Jie Hu; Guanghui Wang 002; Donglei Yang (Eur. J. Comb., 2022)

Tiling multipartite hypergraphs in quasi-random hypergraphs. - Laihao Ding; Jie Han 002; Shumin Sun; Guanghui Wang 002; Wenling Zhou (J. Comb. Theory B, 2023)

Covering the edges of a graph with triangles. - Csilla Bujtás; Akbar Davoodi; Laihao Ding; Ervin Györi; Zsolt Tuza; Donglei Yang (Discret. Math., 2025)