GJ Chang, GH Duh - arXiv preprint arXiv:1508.03052, 2015 - researchgate.net
A strong k-edge-coloring of a graph G is a mapping from E (G) to {1, 2,..., k} such that every
pair of distinct edges at distance at most two receive different colors. The strong chromatic …