A Linear Algorithm for Colouring Planar Graphs with Five Colours
Open Access
- 1 January 1985
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 28 (1) , 78-81
- https://doi.org/10.1093/comjnl/28.1.78
Abstract
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.This publication has 0 references indexed in Scilit: