Improved edge-coloring algorithms for planar graphs

DOI10.1016/0196-6774(90)90032-AzbMath0711.68080OpenAlexW2088252177MaRDI QIDQ3495664

Marek Chrobak, Takao Nishizeki

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90032-a

zbMATH Keywords

edge-coloringplanar graphsparallel algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distributed algorithms (68W15)

Related Items (4)

A parallel algorithm for edge-coloring partial k-trees ⋮ A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ New linear-time algorithms for edge-coloring planar graphs

This page was built for publication: Improved edge-coloring algorithms for planar graphs