Diregular c-partite tournaments are Vertex-Pancyclic When c >= 5

Authors
Yeo, A
Citation
A. Yeo, Diregular c-partite tournaments are Vertex-Pancyclic When c >= 5, J GRAPH TH, 32(2), 1999, pp. 137-152
Citations number
8
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
32
Issue
2
Year of publication
1999
Pages
137 - 152
Database
ISI
SICI code
0364-9024(199910)32:2<137:DCTAVW>2.0.ZU;2-4
Abstract
In [Volkmann, to appear] it is conjectured that all diregular c-partite tou rnaments, with c greater than or equal to 4, are pancyclic. In this article , we show that all diregular c-partite tournaments, with c greater than or equal to 5, are in fact vertex-pancyclic. (C) 1999 John Wiley & Sons, Inc. J Graph Theory 32: 137-152, 1999.