Recent progress on strong edge-coloring of graphs
Document Type
Article
Publication Date
10-1-2019
Abstract
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.
Repository Citation
Deng, K.,
Yu, G.,
& Zhou, X.
(2019). Recent progress on strong edge-coloring of graphs. Discrete Mathematics, Algorithms and Applications, 11 (5).
https://corescholar.libraries.wright.edu/math/383
DOI
10.1142/S1793830919500629
