An algorithm for colouring perfect planar graphs
- First Online:
- Cite this paper as:
- Stewart I.A. (1987) An algorithm for colouring perfect planar graphs. In: Nori K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.