A Linear Algorithm for Colouring Planar Graphs with Five Colours

DOI10.1093/COMJNL/28.1.78MaRDI QIDQ3219789zbMATH OpenOpenAlexFDO

Authors

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

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

Recommendations

• On linear-time algorithms for five-coloring planar graphs
• Colouring planar graphs
• scientific article; zbMATH DE number 1256776
• scientific article; zbMATH DE number 4049083
• New linear-time algorithms for edge-coloring planar graphs

Cited in

(10)

• On linear-time algorithms for five-coloring planar graphs
• An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring
• Four colouring the vertices of the triangulation of a polygon containing a hole
• Colouring planar graphs
• scientific article; zbMATH DE number 4049083 (Why is no real title available?)
• scientific article; zbMATH DE number 4065017 (Why is no real title available?)
• Distributed algorithms for maximum cliques
• The complexity of growing a graph
• An efficient parallel algorithm for computing a large independent set in a planar graph
• Coloring certain proximity graphs

This page was built for publication: A Linear Algorithm for Colouring Planar Graphs with Five Colours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219789)