Highly Influenced

A strong k-edge-coloring of a graph G is an assignment of k colors to the edges of G in such a way that any two edges meeting at a common vertex, or being adjacent to the same edge of G, are assigned different colors. The strong chromatic index of G is the smallest number k for which G has a strong k-edge-coloring. A Halin graph is a planar graph consistingâ€¦Â (More)