Laihao Ding

According to our database, Laihao Ding authored at least 9 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

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

2023

Tiling multipartite hypergraphs in quasi-random hypergraphs.

Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang, Wenling Zhou

J. Comb. Theory B, May, 2023

2022

Properly colored short cycles in edge-colored graphs.

Laihao Ding, Jie Hu, Guanghui Wang, Donglei Yang

Eur. J. Comb., 2022

2020

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.

Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu

Discret. Math., 2020

2019

Graphs are (1, Δ+1)-choosable.

Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu

Discret. Math., 2019

2018

Generalized acyclic edge colorings via entropy compression.

Laihao Ding, Guanghui Wang, Jianliang Wu

J. Comb. Optim., 2018

2017

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.

Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu

Graphs Comb., 2017

2016

Neighbor Sum Distinguishing Index of K₄-Minor Free Graphs.

Jianghua Zhang, Laihao Ding, Guanghui Wang, Guiying Yan, Shan Zhou

Graphs Comb., 2016

2015

Neighbor sum distinguishing total colorings of planar graphs.

Hualong Li, Laihao Ding, Bingqiang Liu, Guanghui Wang

J. Comb. Optim., 2015