Recent progress on strong edge-coloring of graphs
A strong edge-coloring of a graph G = (V,E) is a partition of its edge set E into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.
& Zhou, X.
(2019). Recent progress on strong edge-coloring of graphs. Discrete Mathematics, Algorithms and Applications, 11 (5).