✦ LIBER ✦

On Cycles in Multipartite Tournaments

✍ Scribed by G. Gutin

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 109 KB
Volume: 58
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1047

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles in Multipartite Tournaments

✍ Y.B. Guo; L. Volkmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On 4-cycles in random bipartite tourname

On 4-cycles in random bipartite tournaments

✍ Béla Bollobés; Ove Frank; Michał KarońSki 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 2 views

We consider a random rn by n bipartite tournament T, , consisting of rnn independent random arcs which have a common probability p of being directed from the rn part to the n part. We determine the expected value and variance of the number of 4-cycles in T,,,, and the probability that T, , has no cy

Oriented Hamiltonian Cycles in Tournamen

Oriented Hamiltonian Cycles in Tournaments

✍ Frédéric Havet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 379 KB

We prove that every tournament of order n 68 contains every oriented Hamiltonian cycle except possibly the directed one when the tournament is reducible.

Complementary Cycles of All Lengths in T

Complementary Cycles of All Lengths in Tournaments

✍ Z.M. Song 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

On the existence of specified cycles in

On the existence of specified cycles in a tournament

✍ Abdelhamid Benhocine; A. Pawel Wojda 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB 👁 1 views

For 2 s p s n and n 2 3, D(n, p) denotes the digraph with n vertices obtained from a directed cycle of length n by changing the orientation of p -1 consecutives edges. In this paper, we prove that every tournament of order n 2 7 contains D(n, p ) for p = 2, 3, ..., n. Furthermore, we determine the t