Recent progress on strong edge-coloring of graphs
Kecai Deng, Gexin Yu, Xiangqian Zhou · Discrete Mathematics Algorithms and Applications · 2019
A strong edge-coloring of a graph [Formula: see text] is a partition of its edge set [Formula: see text] into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.