Hamilton surfaces for the complete symmetric tripartite graph (Q1115874)

The authors present two-dimensional analogues of some of the well-known theorems on decomposition of a complete graph into 1-factors and/or Hamiltonian cycles. The object to be decomposed is the set of triangles of the complete tripartite graph \(K_{n,n,n}\). A typical example: The set of triangles in \(K_{n,n,n}\) can be decomposed into classes \(C_ 1,C_ 2,...,C_ n\) in such way that the union of \(C_ i\) and \(C_ j\) determines a triangular embedding of \(K_{n,n,n}\) (called here ``Hamilton surface'') if and only if \((i-j,n)=1\).