An algorithm for colouring perfect planar graphs

  • Iain A. Stewart
Session 2 Graph Algorithms & Geometric Algorithms

DOI: 10.1007/3-540-18625-5_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Iain A. Stewart
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle Upon TyneNewcastle Upon TyneEngland

Personalised recommendations