LINEAR ALGORITHM FOR COLOURING PLANAR GRAPHS WITH FIVE COLOURS.

Howard Williams

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)78-81
Number of pages4
JournalComputer Journal
Volume28
Issue number1
Publication statusPublished - Feb 1985

Fingerprint Dive into the research topics of 'LINEAR ALGORITHM FOR COLOURING PLANAR GRAPHS WITH FIVE COLOURS.'. Together they form a unique fingerprint.

Cite this