Proof of the List Coloring Conjecture for line perfect multigraphs

We prove that for a line perfect multigraph the chromatic index is equal to the list chromatic index. This is a generalization of Galvin's result on bipartite multigraphs.