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

Gregory Gutin and Rafiey, A.

(2004)

Gregory Gutin and Rafiey, A. (2004) When n-cycles in n-partite tournaments are longest cycles.. Discrete Mathematics, 289 (1-3).

Our Full Text Deposits

Full text access: Open

Full Text - 146.03 KB

Links to Copies of this Item Held Elsewhere

Link to Publisher Copy

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

Information about this Version

This is a Published version
This version's date is: 2004
This item is peer reviewed

Link to this Version

https://repository.royalholloway.ac.uk/items/1dd6f4e7-127e-0667-342b-bdb90b4bf035/1/

Item TypeJournal Article
TitleWhen n-cycles in n-partite tournaments are longest cycles.
AuthorsGutin, Gregory
Rafiey, A.
Uncontrolled Keywordsn-partite tournament; n-cycle
DepartmentsFaculty of Science\Computer Science

Identifiers
doi10.1016/j.disc.2004.10.007

Deposited by () on 23-Dec-2009 in Royal Holloway Research Online.Last modified on 25-May-2010

Details