@conference {JTH2004,
title = {Binary Merge Model Representation of the Graph Colouring Problem},
booktitle = {Springer Lecture Notes on Computer Science},
number = {3004},
year = {2004},
pages = {124--134},
publisher = {Springer-Verlag, Berlin},
organization = {Springer-Verlag, Berlin},
type = {inproceedings},
abstract = {This paper describes a novel representation and ordering model that aided by an evolutionary algorithm, is used in solving the graph \emph{k}-colouring problem. Its strength lies in reducing the search space by breaking symmetry. An empirical comparison is made with two other algorithms on a standard suit of problem instances and on a suit of instances in the phase transition where it shows promising results.},
keywords = {constraint satisfaction, graph colouring},
isbn = {3-540-21367-8},
author = {Juhos, I. and T{\'o}th, A. and van Hemert, J. I.},
editor = {J. Gottlieb and G. Raidl}
}