Proof of the List Coloring Conjecture for line perfect multigraphs

Abstract

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. Soon after the first version was submitted to arxiv, I found out that the same result has already been achieved in an older paper by Peterson and Woodall, by a similar but not entirely the same method.