arXiv Open Access 2011

Edge-coloring series-parallel multigraphs

Cristina G. Fernandes Robin Thomas

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS math.CO

Penulis (2)

Cristina G. Fernandes

Robin Thomas

Format Sitasi

APA MLA BibTeX

Fernandes, C.G., Thomas, R. (2011). Edge-coloring series-parallel multigraphs. https://arxiv.org/abs/1107.5370

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓