Abstract: A strong edge coloring of a graph is a proper edge coloring such that no two edges within a distance of two share the same color. The strong chromatic index of the graph G is denoted by χ′ ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback