1. N. Alon and G. Gutin: Properly colored Hamilton cycles in edge-colored completegraphs, Random Structures Algorithms 11 (1997), 179–186.
2. N. Alon and J.H. Spencer: The Probabilistic Method, Wiley-Intersci. Ser. DiscreteMath. Optim., John Wiley & Sons, Hoboken, NJ, 2000.
3. J. Bang-Jensen and G. Gutin: Digraphs, second ed., Springer Monographs in Mathematics, Springer-Verlag London Ltd., London, 2009, Theory, algorithms andapplications.
4. J. Bang-Jensen, G. Gutin and A. Yeo: Properly coloured Hamiltonian paths inedge-coloured complete graphs, Discrete Appl. Math. 82 (1998), 247–250.
5. O. Barr: Properly coloured Hamiltonian paths in edge-coloured complete graphswithout monochromatic triangles, Ars Combin. 50 (1998), 316–318.