%0 Journal Article
%T Graph colouring algorithms
%A Thore Husfeldt
%J Computer Science
%D 2015
%I arXiv
%X 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.
%U http://arxiv.org/abs/1505.05825v1