Recent progress on strong edge-coloring of graphs
Abstract
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.
Remember to check out the Most Cited Articles! |
---|
Be inspired by these NEW Mathematics books for inspirations & latest information in your research area! |