Graph Colouring Algorithms

Research output: Conference Article in Proceeding or Book/Report chapterBook chapterResearchpeer-review


This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.
Original languageEnglish
Title of host publicationTopics in Chromatic Graph Theory
EditorsLowell W. Beineke, Robin J. Wilson
PublisherCambridge University Press
Publication dateMay 2015
ISBN (Print)987-1-107-3350-4
Publication statusPublished - May 2015
SeriesEncyclopedia of Mathematics and Its Applications


Dive into the research topics of 'Graph Colouring Algorithms'. Together they form a unique fingerprint.

Cite this