1 paper · 1 filter
Runze Wang
A strong edge-coloring of a graph G is an edge-coloring such that any two edges of distance at most two receive distinct colors. The minimum number of colors we need in order to…