An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors

DOI10.1016/0304-3975(90)90079-WzbMath0701.68047OpenAlexW2031355167MaRDI QIDQ914387

Xin He

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90079-w

zbMATH Keywords

edge coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

New linear-time algorithms for edge-coloring planar graphs

Cites Work

• Some simplified NP-complete graph problems
• Coloring planar graphs in parallel
• Efficient parallel algorithms for edge coloring problems
• Fast algorithms for edge-coloring planar graphs
• An O(logn) parallel connectivity algorithm

This page was built for publication: An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors