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

Research output: Contribution to journalArticlepeer-review

28 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)137-152
Number of pages16
JournalJournal of Graph Theory
Volume32
Issue number2
DOIs
Publication statusPublished - Oct 1999
Externally publishedYes

Keywords

  • Multipartite tournaments
  • Pancyclic
  • Regular
  • Vertex-pancyclic

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint

Dive into the research topics of 'Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5'. Together they form a unique fingerprint.

Cite this