Computer Science – Data Structures and Algorithms
Scientific paper
2011-07-27
Computer Science
Data Structures and Algorithms
Scientific paper
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.
Fernandes Cristina G.
Thomas Robin
No associations
LandOfFree
Edge-coloring series-parallel multigraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Edge-coloring series-parallel multigraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge-coloring series-parallel multigraphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-112580