A Linear Algorithm for Colouring Planar Graphs with Five Colours
M. Howard Williams · The Computer Journal · 1985
A linear algorithm for colouring planar graphs with at most five colours 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 in this paper.