Edge-coloring series-parallel multigraphs
Data Structures and Algorithms
2011-08-01 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1107.5370,
title = {Edge-coloring series-parallel multigraphs},
author = {Cristina G. Fernandes and Robin Thomas},
journal= {arXiv preprint arXiv:1107.5370},
year = {2011}
}