Lai-hao Ding

Available identifiers

Publication	Date of Publication	Type
Covering the edges of a graph with triangles	2024-11-09	Paper
Vanishing codegree Tur\'{a}n density implies vanishing uniform Tur\'{a}n density	2023-12-05	Paper
F$F$‐factors in Quasi‐random Hypergraphs	2023-08-22	Paper
Tiling multipartite hypergraphs in quasi-random hypergraphs	2023-03-23	Paper
Properly colored short cycles in edge-colored graphs	2022-01-07	Paper
Tiling multipartite hypergraphs in Quasi-random Hypergraphs	2021-11-28	Paper
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs	2020-05-21	Paper
Properly colored short cycles in edge-colored graphs	2019-11-04	Paper
Graphs are $(1, \varDelta + 1)$-choosable	2018-11-13	Paper
Generalized acyclic edge colorings via entropy compression	2018-04-13	Paper
Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz	2018-04-05	Paper
Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz	2017-10-11	Paper
Neighbor sum distinguishing index of $K_4$-minor free graphs	2016-07-28	Paper
Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz	2016-05-23	Paper
Neighbor sum distinguishing total colorings of planar graphs	2015-09-28	Paper
Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz	2014-12-03	Paper

This page was built for person: Lai-hao Ding