List-chromatic index
= List-chromatic index
{title2=$\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>.