✦ LIBER ✦

Vertex pancyclic in-tournaments

✍ Scribed by Meike Tewes; Lutz Volkmann

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 216 KB
Volume: 36
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200102)36:2<84::aid-jgt4>3.0.co;2-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Diregularc-partite tournaments are verte

Diregularc-partite tournaments are vertex-pancyclic whenc ? 5

✍ Yeo, Anders 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB

## 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.

Pancyclic arcs and connectivity in tourn

Pancyclic arcs and connectivity in tournaments

✍ F. Havet 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract A __tournament__ is an orientation of the edges of a complete graph. An arc is __pancyclic__ in a tournament __T__ if it is contained in a cycle of length __l__, for every 3 ≤ __l__ ≤ |T|. Let __p__(__T__) denote the number of pancyclic arcs in a tournament __T__. In 4, Moon showed that

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

Vertex-pancyclicity of hypertournaments

✍ Jed Yang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract A hypertournament or a __k__‐tournament, on __n__ vertices, 2≤__k__≤__n__, is a pair __T__=(__V, E__), where the vertex set __V__ is a set of size __n__ and the edge set __E__ is the collection of all possible subsets of size __k__ of __V__, called the edges, each taken in one of its __

Characterizations of vertex pancyclic an

Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs

✍ G. Gutin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 527 KB

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite graph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with both end vert

Vertex critical r-dichromatic tournament

Vertex critical r-dichromatic tournaments

✍ V Neumann-Lara; J Urrutia 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 205 KB