This page contains two deterministic local one-round colour reduction algorithms for k-coloured directed cycles. These algorithms map k-coloured local neighbourhoods into new colours such that a new proper vertex colouring is attained. For more information, see this work.
The algorithms are given in the following format. Each line consists of four non-negative integer values separated by whitespace. In each line, the first three values correspond to the local neighbourhood whereas the fourth value is the output of the algorithm.
The following python script (Python 2.6.5) can be used to automatically verify the correctness of these algorithms: validate.py.
To check the validity of the first algorithm run
$ python validate.py 24 colouring-k24-t1-c4.txt
and similarly, for the second algorithm run
$ python validate.py 70 colouring-k70-t1-c5.txt
Author: Joel Rybicki. Date: 13 June 2011.