Title of article
When n-cycles in n-partite tournaments are longest cycles
Author/Authors
Gregory Gutin، نويسنده , , Arash Rafiey، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
163
To page
168
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).
Keywords
n-partite tournament , Longest cycles , Short cycles
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948659
Link To Document