1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
Matching of given sizes in hypergraphs
Yulin Chang, Huifen Ge, Jie Han +1
For all integers such that and , let be a sufficiently large integer {\rm(}which may not be divisible by {\rm)} and let $s\le \lfloor n/…
Factors in randomly perturbed hypergraphs
Yulin Chang, Jie Han, Yoshiharu Kohayakawa +2
We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a -graph with minimum vertex degree to ensure an -…
List strong edge-coloring of graphs with maximum degree 4
Baochen Zhang, Yulin Chang, Jie Hu +2
A strong edge-coloring of a graph is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'…