Fast algorithms for edge-coloring planar graphs

DOI10.1016/0196-6774(89)90022-9zbMath0664.05021OpenAlexW2031494717MaRDI QIDQ3815319

Marek Chrobak, Mordechai M. Yung

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90022-9

zbMATH Keywords

algorithmsedge-coloringplanar graphoptimal coloring

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) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The maximal f-dependent set problem for planar graphs is in NC ⋮ An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors ⋮ The maximal \(f\)-dependent set problem for planar graphs is in NC ⋮ New linear-time algorithms for edge-coloring planar graphs

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