Title

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.

DOI

10.1142/S1793830919500629

Find in your library

Off-Campus WSU Users


Share

COinS