Some sequential graph colouring algorithms

We describe a heuristic algorithm to colour the vertices of a graph which relies upon the comparison of the degrees and structure of the graph. We have compared it with the maximum-degree-node-first and minimum-degree-node-last criteria based algorithms. The interchange of colours without bound normally amounts to an exhaustive search and hence is not taken into account. Additionally, this paper reviews a broad spectrum of sequential vertex colouring algorithms based on heuristics.