5 citations · 7 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
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…
math.CO2026
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…