List Edge Colorings of Outerplanar Graphs

The List Edge Coloring Conjecture states that for every graph, the chromatic index equals the choice index. We prove the conjecture for outerplanar graphs with maximum degree at least five.