4 citations · 9 across the 10 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CO2025
A step toward Chen-Lih-Wu conjecture
Yangyang Cheng, Zhenyu Li, Wanting Sun +1
An equitable -coloring of a graph is a proper -coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connec…
math.CO2025
An exact Ore-degree condition for Hamilton cycles in oriented graphs
Yulin Chang, Yangyang Cheng, Tianjiao Dai +2
An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph of sufficiently large order…
math.CO2025
Transversal Hamilton cycles in digraph collections
Yangyang Cheng, Heng Li, Wanting Sun +1
Given a collection of digraphs on the common vertex set , an -edge digraph with vertices in is \textit{transversal} in $\mathcal…