  We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel
multigraphs and derive a linear-time algorithm to check whether a given
series-parallel multigraph can be colored with a given number of colors.
