A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs

DOI10.1006/jagm.1996.0008zbMath0840.68093OpenAlexW2038443890MaRDI QIDQ4864439

Hitoshi Suzuki, Xiao Zhou, Takao Nishizeki

Publication date: 20 February 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0008

zbMATH Keywords

series-parallel multigraphsedge-coloring problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers ⋮ Acyclic chromatic index of chordless graphs ⋮ A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES

This page was built for publication: A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs