An algorithm for colouring perfect planar graphs

An algorithm for colouring perfect planar graphs

0.00 Avg rating0 Votes
Article ID: iaor19881171
Country: Netherlands
Volume: 31
Issue: 2
Start Page Number: 97
End Page Number: 101
Publication Date: Apr 1989
Journal: Information Processing Letters
Authors:
Keywords: combinatorial analysis
Abstract:

This paper presents 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.

Reviews

Required fields are marked *. Your email address will not be published.