Date: 27 May 2005

An algorithm for colouring perfect planar graphs

* 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.