Edge-coloring series-parallel multigraphs

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-112580

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.