Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5

  • Authors:
  • Anders Yeo

  • Affiliations:
  • Department of Mathematics and Computer Science, Odense University, DK-5230, Odense, Denmark

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

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