5 citations · 7 across the 5 of their papers we have counts for
5 papers
Strong chromatic index of bipartite graphs
Yanli Hao, Tianchi Yang, Xingxing Yu
An edge-coloring of a graph is called a strong edge-coloring if all its color classes are induced matchings in ; the minimum number of colors required for such a coloring, d…
Improved bounds for the chromatic index of -uniform hypergraphs
Sarah Frederickson, Yanli Hao, Tom Kelly
In 1997, Alon and Kim conjectured that if is a -uniform -simple hypergraph with maximum degree sufficiently large, then the chromatic index is upper bounded b…
A short proof of the Goldberg-Seymour conjecture
Guantao Chen, Yanli Hao, Xingxing Yu +1
For a multigraph , denotes the chromatic index of , the maximum degree of , and $Γ(G) = \max\left\{\left\lceil \frac{2|E(H)|}{|V(H)|-1} \right\rceil: H \sub…
Decreasing the mean subtree order by adding edges
Stijn Cambie, Guantao Chen, Yanli Hao +1
The mean subtree order of a given graph , denoted , is the average number of vertices in a subtree of . Let be a connected graph. Chin, Gordon, MacPhee, and Vincent…
Linear arboricity of degenerate graphs
Guantao Chen, Yanli Hao, Guoning Yu
A linear forest is a union of vertex-disjoint paths, and the linear arboricity of a graph , denoted by , is the minimum number of linear forests needed to…