✦ LIBER ✦

Diregularc-partite tournaments are vertex-pancyclic whenc ? 5

✍ Scribed by Yeo, Anders

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 373 KB
Volume: 32
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199910)32:2<137::aid-jgt4>3.0.co;2-i

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A local tournament contains a vertex who

A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic

✍ Wei Meng; Shengjia Li; Yubao Guo; Gaokui Xu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

## Abstract An arc leaving a vertex x in a digraph is called an out‐arc of x. Thomassen (J Combin Theory Ser B 28 (1980), 142–163) proved that every strong tournament contains a vertex whose every out‐arc is contained in a Hamiltonian cycle. In 2000, Yao et al. (Discrete Appl Math 99 (2000), 245–24