The paper presents fast sequential and distributed algorithms for finding a proper (Δ+1)-edge-coloring of a graph with maximum degree Δ, with a focus on the case when Δ is constant.
