The following pages link to Lai-hao Ding (Q287912):
Displaying 16 items.
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- (Q477255) (redirect page) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- Properly colored short cycles in edge-colored graphs (Q2065117) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
- F$F$‐factors in Quasi‐random Hypergraphs (Q6134524) (← links)
- Covering the edges of a graph with triangles (Q6635092) (← links)
- On $3$-graphs with vanishing codegree Turán density (Q6736217) (← links)
- Induced even cycles in locally sparse graphs (Q6754142) (← links)
