Loading...
Please wait, while we are loading the content...
Similar Documents
Edge-coloring series-parallel multigraphs (2000).
| Content Provider | CiteSeerX |
|---|---|
| Author | Fernandes, Cristina G. Thomas, Robin |
| 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. |
| File Format | |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Edge-coloring Series-parallel Multigraphs Parallel Edge Chromatic Index Odd Oe Ju Gamma Max Ae Introduction Graph Petersen Graph Maximum Degree Linear-time Algorithm Distinct Edge Series-parallel Multigraph Ju Jc Simpler Proof |
| Content Type | Text |