✦ LIBER ✦

Powers of Hamilton cycles in tournaments

✍ Scribed by Béla Bollobás; Roland Häggkvist

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 487 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90085-e

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

Cycles in bipartite tournaments

✍ Lowell W Beineke; Charles H.C Little 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 260 KB

On Cycles in Multipartite Tournaments

✍ G. Gutin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 109 KB

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.

Long cycles in bipartite tournaments

✍ Jianzhong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 318 KB

A digraph D is said to satisfy the condition O(n) ifd~-(u) + d r (v) >t n whenever uv is not an arc of D. In this paper we prove the following results: If a p x q bipartite tournament T is strong and satisfies O(n), then T contains a cycle of length at least min(2n + 2, 2p, 2q}, unless T is isomorph

Cycles throughkvertices in bipartite tou

Cycles throughkvertices in bipartite tournaments

✍ J. Bang-Jensen; Y. Manoussakis 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 208 KB