Gutin, Gregory and Rafiey, A. (2004) When n-cycles in n-partite tournaments are longest cycles.. Discrete Mathematics, 289 (1-3).
Full text access: Open
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976 that every strong n-partite tournament has an n-cycle. We characterize strong n-partite tournaments in which a longest cycle is of length n and, thus, settle a problem in Volkmann (Discrete Math. 199 (1999) 279).
This is a Submitted version This version's date is: 2004 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/1dd6f4e7-127e-0667-342b-bdb90b4bf035/4/
Deposited by Research Information System (atira) on 27-Jan-2013 in Royal Holloway Research Online.Last modified on 27-Jan-2013