Abstract
A strong k-edge-coloring of a graph G is an edge-coloring with k colors in which every color class is an induced matching. The strong chromatic index of G, denoted by χs′(G), is the minimum k for which G has a strong k-edge-coloring. In 1985, Erdős and Nešetřil conjectured that χs′(G)≤54Δ(G)2, where Δ(G) is the maximum degree of G. When G is a graph with maximum degree at most 3, the conjecture was verified independently by Andersen and Horák, Qing, and Trotter. In this paper, we consider the list version of strong edge-coloring. In particular, we show that every subcubic graph has strong list-chromatic index at most 11 and every planar subcubic graph has strong list-chromatic index at most 10.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
