𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of all Hamiltonian paths in tournaments

✍ Scribed by V. Ya. Burdyuk; A. A. Kakhichko; V. V. Shcherbak

Publisher
Springer US
Year
1978
Tongue
English
Weight
376 KB
Volume
14
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ 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.

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