On homomorphisms to edge-coloured cycles

Alon, 1998, Homomorphisms of edge coloured graphs and Coxeter groups, J. Algebraic Combinatorics, 8, 5, 10.1023/A:1008647514949 Brewster, 1993, Vertex colourings of edge-coloured graphs, Ph.D. Thesis, Simon Fraser University Brewster, 1994, The complexity of colouring symmetric relational systems, Discrete Appl. Math., 49, 95, 10.1016/0166-218X(94)90203-8 Feder, 1999, Classication of homomorphisms to oriented cycles, submitted Feder, 1999, The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory, SIAM J Comput., 28, 57, 10.1137/S0097539794266766 P. Hell, A.V. Kostochka, A. Raspaud, and E. Sopena, On nice graphs, Discrete Math., accepted. Hell, 1990, On the complexity of H-colouring, J. Combin Th. (B), 48, 92, 10.1016/0095-8956(90)90132-J Hell, 1993, Homomorphisms to oriented cycles, Combinatorica, 13, 421, 10.1007/BF01303514 Zhu, 1995, A polynomial algorithm for homomorphisms to oriented cycles, J. of Algorithms, 19, 333, 10.1006/jagm.1995.1040