Sciweavers

Share
GC
2006
Springer

On n-partite Tournaments with Unique n-cycle

11 years 11 months ago
On n-partite Tournaments with Unique n-cycle
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n , we characterize strongly connected n-partite tournaments that are not tournaments with exactly one n-cycle. For n 5, we enumerate such non-isomorphic n-partite tournaments.
Gregory Gutin, Arash Rafiey, Anders Yeo
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2006
Where GC
Authors Gregory Gutin, Arash Rafiey, Anders Yeo
Comments (0)
books