9 citations · 22 across the 13 of their papers we have counts for
1 paper · 1 filter
Rong Luo, Gexin Yu
We show that every 2-degenerate graph with maximum degree Δ has a strong edge-coloring with at most 8Δ−4 colors.