Edge-coloring series-parallel multigraphs
Cristina G. Fernandes, Robin Thomas
TL;DR
This paper presents a simplified proof of Seymour's Theorem for edge-coloring series-parallel multigraphs and introduces a linear-time algorithm to determine colorability with a specified number of colors.
Contribution
It provides a simpler proof of a key theorem and develops an efficient algorithm for edge-coloring series-parallel multigraphs.
Findings
Simplified proof of Seymour's Theorem
Linear-time algorithm for edge-coloring decision
Applicable to series-parallel multigraphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Graph Theory Research · Limits and Structures in Graph Theory