I.  Juhos, Tóth, A., and van Hemert, J. I., ?Heuristic Colour Assignment Strategies for Merge Models in Graph Colouring?, in Springer Lecture Notes on Computer Science, 2005, p. 132--143.

I.  Juhos, Tóth, A., and van Hemert, J. I., ?Binary Merge Model Representation of the Graph Colouring Problem?, in Springer Lecture Notes on Computer Science, 2004, p. 124--134.

I.  Juhos, Tóth, A., Tezuka, M., Tann, P., and van Hemert, J. I., ?A new permutation model for solving the graph k-coloring problem?, in Kalmàr Workshop on Logic and Computer Science, 2003, p. 189--199.