✦ LIBER ✦

Tournaments That Admit Exactly One Hamiltonian Circuit

✍ Scribed by Douglas, R. J.

Book ID: 120102428
Publisher: Oxford University Press
Year: 1970
Tongue: English
Weight: 290 KB
Volume: s3-21
Category: Article
ISSN: 0024-6115
DOI: 10.1112/plms/s3-21.4.716

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On enumerating tournaments that admit ex

On enumerating tournaments that admit exactly one Hamiltonian circuit

✍ M.R Garey 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Graphs with exactly one hamiltonian circ

Graphs with exactly one hamiltonian circuit

✍ John Sheehan 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

## Abstract Let __h(n__) be the largest integer such that there exists a graph with __n__ vertices having exactly one Hamiltonian circuit and exactly __h(n__) edges. We prove that __h(n__) = [__n__^2^/4]+1 (__n__ ≧ 4) and discuss some related problems.

On a class of model systems that admit a

On a class of model systems that admit a lowering of powers in the Hamiltonian in the thermodynamic limit. II

✍ N. N. Bogolyubov; D. Ya. Petrina 📂 Article 📅 1978 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 573 KB

On a class of model systems that admit a

On a class of model systems that admit a lowering of powers in the Hamiltonian in the thermodynamic limit. I

✍ N. N. Bogolyubov; D. Ya. Petrina 📂 Article 📅 1977 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 771 KB