Session 2 Graph Algorithms & Geometric Algorithms

Foundations of Software Technology and Theoretical Computer Science

Volume 287 of the series Lecture Notes in Computer Science pp 58-64


An algorithm for colouring perfect planar graphs

  • Iain A. StewartAffiliated withComputing Laboratory, University of Newcastle Upon Tyne

* Final gross prices may vary according to local VAT.

Get Access


We present an algorithm to properly colour a perfect, planar graph G using λ(G) colours. This algorithm has time complexity O(n3/2) and is recursive, based on the Lipton-Tarjan Separator Algorithm.