Article
Recent progress on strong edge-coloring of graphs
Discrete Mathematics, Algorithms and Applications
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.
DOI
10.1142/S1793830919500629
Citation Information
Kecai Deng, Gexin Yu and Xiangqian Zhou. "Recent progress on strong edge-coloring of graphs" Discrete Mathematics, Algorithms and Applications Vol. 11 Iss. 5 (2019) ISSN: 17938309 Available at: http://works.bepress.com/xiangqian_zhou/11/