✦ LIBER ✦

The maximum number of Hamiltonian paths in tournaments

✍ Scribed by Noga Alon

Publisher: Springer-Verlag
Year: 1990
Tongue: English
Weight: 245 KB
Volume: 10
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02128667

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of all Hamiltonian paths in

Construction of all Hamiltonian paths in tournaments

✍ V. Ya. Burdyuk; A. A. Kakhichko; V. V. Shcherbak 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 376 KB

Path numbers of tournaments

✍ Brian Alspach; David W Mason; Norman J Pullman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Slater orders and Hamiltonian paths of t

Slater orders and Hamiltonian paths of tournaments

✍ Irène Charon; Olivier Hudry 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 173 KB

On the number of Hamiltonian cycles in t

On the number of Hamiltonian cycles in tournaments

✍ Carsten Thomassen 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 949 KB

The main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at leas

A Parallel Reduction of Hamiltonian Cycl

A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments

✍ E. Bampis; M. Elhaddad; Y. Manoussakis; M. Santha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 393 KB

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.