Alternating Hamiltonian circuits in edge-coloured bipartite graphs (Q1186314)

A Hamiltonian circuit \(C\) on an edge-coloured graph is called alternating if adjacent edges of \(C\) have distinct colours. Author proves that the complete bipartite graph \(K_{n,n}\) has an alternating Hamiltonian circuit if the subgraph induced by the edges of each colour is regular of order \(2n\). In fact he proves a somewhat stronger result, and shows that it is best possible.