The paper shows that if G=KnÅ,n is edge-coloured with r≥2 colours so that the subgraph induced by the edges of each colour is regular of order 2n, then G has a Hamiltonian circuit in which adjacent edges have different colours. It also gives a generalization of this result to the case when G is a regular bipartite graph.
