Premium
Diregular c ‐partite tournaments are vertex‐pancyclic when c ≥ 5
Author(s) -
Yeo Anders
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199910)32:2<137::aid-jgt4>3.0.co;2-i
Subject(s) - combinatorics , vertex (graph theory) , mathematics , graph , discrete mathematics
In [Volkmann, to appear] it is conjectured that all diregular c ‐partite tournaments, with c ≥ 4, are pancyclic. In this article, we show that all diregular c ‐partite tournaments, with c ≥ 5, are in fact vertex‐pancyclic. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 137–152, 1999