The pancyclicity of regular 4-partite tournaments was investigated.To seek for a cycle with certain length in original-digraph was reduced to find a Hamilton cycle of some sub-digraph.Using Hamilton theories of digraphs and combining the notion and properties of reduction
a sufficient condition for a regular 4-partite tournament to be pancyclic was obtained and the following result is proved:LetDbe a regular 4-partite tournament with partite sets V1
V2
V3
V4and|Vi|=vD*≥8(i=1
2
3
4).If Vi-1 dominates at least 「V*D vertices in Vi(1≤i≤4