10 citations · 10 across the 2 of their papers we have counts for
2 papers
math.CO2018
The strong chromatic index of -bipartite graphs
Mingfang Huang, Gexin Yu, Xiangqian Zhou
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. We study bipartite graphs with one part having maximum degree at most and…
math.CO2018★ 10 cited
Strong chromatic index of graphs with maximum degree four
Mingfang Huang, Michael Santana, Gexin Yu
A strong edge-coloring of a graph is a coloring of the edges such that every color class induces a matching in . The strong chromatic index of a graph is the minimum number…