Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments (Q1201912)

A tournament is an orientation of a complete graph. A tournament \(T\) is called cyclic if its automorphism group \(G(T)\) contains the permutation \(C=(1,2,\dots,n)\), where \(n\) is the number of vertices of \(T\). This paper describes polynomial algorithms to recognize cyclic tournaments and to determine if two given cyclic tournaments are isomorphic. The complexity of the general isomorphism problem for tournaments remains open.