List-chromatic index ($\chi {\prime }_{\ell }(G)$)

The list-chromatic index is the least integer $q$ such that every assignment of at least $q$ allowed colors to each edge admits a list edge coloring. Uniform identical lists show it is at least the chromatic index. The Galvin theorem for bipartite list edge coloring gives equality for bipartite graphs.

A bipartite graph has equal list-chromatic index, chromatic index and maximum degree of a graph $\Delta$. Start with a proper $\Delta$-edge coloring. Orient its line graph toward smaller colors at one part and toward larger colors at the other. An edge of color $c$ has at most $(c-1)+(\Delta -c)=\Delta -1$ outgoing neighbours. Every induced orientation has a digraph kernel obtained from a stable matching in a bipartite graph with those preferences. Apply the kernel list-coloring lemma.