Abstract
A linear algorithm for coloring planar graphs with at most five colors has recently been published. However, this algorithm, which operates by recursive reduction of the graph, is unnecessarily complicated. An alternative method which is much simpler is presented.
| Original language | English |
|---|---|
| Pages (from-to) | 78-81 |
| Number of pages | 4 |
| Journal | Computer Journal |
| Volume | 28 |
| Issue number | 1 |
| Publication status | Published - Feb 1985 |