Edge-coloring series-parallel multigraphs
classification
💻 cs.DS
math.CO
keywords
series-paralleledge-coloringgivenmultigraphsalgorithmcheckcoloredcolors
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.