A Linear Algorithm for Colouring Planar Graphs with Five Colours

DOI10.1093/comjnl/28.1.78zbMath0556.68036OpenAlexW2121657257MaRDI QIDQ3219789

No author found.

Publication date: 1985

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/28.1.78

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items

The complexity of growing a graph, Distributed algorithms for maximum cliques, Coloring certain proximity graphs, An efficient parallel algorithm for computing a large independent set in a planar graph