When n-cycles in n-partite tournaments are longest cycles

Gregory Gutin,Arash Rafiey

doi:10.1016/j.disc.2004.10.007

When n-cycles in n-partite tournaments are longest cycles

Gregory Gutin, Arash Rafiey

https://doi.org/10.1016/j.disc.2004.10.007

Copy DOI

Journal: Discrete Mathematics	Publication Date: Dec 1, 2004
Citations: 9

Affiliation: Royal Holloway University of London

#Longest Cycle #N-partite Tournament + Show 4 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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).

Full Text