Skip to main content
Journal ArticleOPEN ACCESS

LINEAR ALGORITHM FOR COLOURING PLANAR GRAPHS WITH FIVE COLOURS.

Computer Journal (1985) 28(1) 78-81
DOI: 10.1093/comjnl/28.1.78
15Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Williams, M. H. (1985). LINEAR ALGORITHM FOR COLOURING PLANAR GRAPHS WITH FIVE COLOURS. Computer Journal, 28(1), 78–81. https://doi.org/10.1093/comjnl/28.1.78

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free