𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Oriented Hamiltonian Cycles in Tournaments

✍ Scribed by Frédéric Havet

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
379 KB
Volume
80
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Finding an Oriented Hamiltonian Path in
Finding an Oriented Hamiltonian Path in a Tournament
✍ Frédéric Havet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We present an O n algorithm for finding a specified oriented path of order at Ž 2 . least n in a tournament of order n. Using this algorithm, we present an O n algorithm that finds a specified oriented path from a given vertex if one exists.

Hamiltonian tournaments with the least n
Hamiltonian tournaments with the least number of 3-cycles
✍ M. Burzio; D. C. Demaria 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 2 views

## Abstract We characterize the family of hamiltonian tournaments with the least number of 3‐cycles, studying their structure and their score sequence. Furthermore, we obtain the number of nonisomorphic tournaments of this family.

Oriented Hamiltonian Paths in Tournament
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture
✍ Frédéric Havet; Stéphan Thomassé 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 284 KB

We prove that with three exceptions, every tournament of order n contains each oriented path of order n. The exceptions are the antidirected paths in the 3-cycle, in the regular tournament on 5 vertices, and in the Paley tournament on 7 vertices. ## 2000 Academic Press Tournaments are very rich st

Orientations of hamiltonian cycles in la
Orientations of hamiltonian cycles in large digraphs
✍ Adam Paweł Wojda 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

We prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n -1) ( n -2) + 2 arcs contains all orientations of a Hamiltonian cycle.