On list edge-colorings of subcubic graphs Original Research Article

In this paper we study list edge-colorings of graphs with small maximal degree. In particular, we show that simple subcubic graphs are ‘10/3-edge choosable’. The precise meaning of this statement is that no matter how we prescribe arbitrary lists of three colors on edges of a subgraph H of G such that Δ(H)⩽2, and prescribe lists of four colors on E(G)∖E(H), the subcubic graph G will have an edge-coloring with the given colors. Several consequences follow from this result.