The list chromatic index of a bipartite multigraph (Q1892837)

The list chromatic index of a multigraph is the least number \(n\) for which the edges can be coloured so that adjacent edges get different colours, the colour of each edge being chosen from an arbitrarily prescribed list of \(n\) different colours associated with that edge. The List Colouring Conjecture (LCC) is that the list chromatic index of a multigraph is always equal to the (ordinary) chromatic index. The LCC has been proved only for a few special classes of graphs, e.g. Janssen has proved it for the graphs \(K_{m, n}\) with \(m\neq n\). In this paper the LCC is proved for all bipartite multigraphs.