A Linear Algorithm for Colouring Planar Graphs with Five Colours

A Linear Algorithm for Colouring Planar Graphs with Five Colours
复制标题

用五种颜色为平面图着色的线性算法

DOI：
10.1093/comjnl/28.1.78
复制
发表时间：
1985
期刊：
Comput. J.
影响因子：
--
通讯作者：
M. H. Williams
M. H. Williams
中科院分区：
--
文献类型：
--
作者：
M. H. Williams

文献摘要

被引文献

相似文献

最近发表了一种用于最多五种颜色的平面图着色的线性算法。然而，该算法通过图的递归约简来操作，不必要地复杂。本文提出了一种简单得多的替代方法。
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.