Skip to main content
Conference Proceedings

An algorithm for colouring perfect planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1987) 287 LNCS 58-64
DOI: 10.1007/3-540-18625-5_42
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Stewart, I. A. (1987). An algorithm for colouring perfect planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 287 LNCS, pp. 58–64). Springer Verlag. https://doi.org/10.1007/3-540-18625-5_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free