Heuristic for rapidly four-coloring large planar graphs
From MaRDI portal
Publication:1180542
DOI10.1007/BF01759077zbMath0746.05060MaRDI QIDQ1180542
Henry D. Shapiro, Craig A. Morgenstern
Publication date: 27 June 1992
Published in: Algorithmica (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Transformations for maximal planar graphs with minimum degree five ⋮ A framework for scalable greedy coloring on distributed-memory parallel computers
Cites Work
- Unnamed Item
- Unnamed Item
- On linear-time algorithms for five-coloring planar graphs
- Planar graphs: Theory and algorithms
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- A graph coloring algorithm for large scheduling problems
- A linear 5-coloring algorithm of planar graphs
- An attempt to understand the four color problem
- A digest of the four color theorem
- New methods to color the vertices of a graph
This page was built for publication: Heuristic for rapidly four-coloring large planar graphs
