𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The construction of optimal Hamiltonian cycles in multivertex graphs

✍ Scribed by Zh. N. Zaitseva; M. E. Shtein


Publisher
Springer US
Year
1976
Tongue
English
Weight
294 KB
Volume
11
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On hamiltonian cycles in the prism over
✍ LetΓ­cia R. Bueno; Peter HorΓ‘k πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 2 views

The Kneser graph K (n, k) has as its vertex set all k-subsets of an n-set and two k-subsets are adjacent if they are disjoint. The odd graph O k is a special case of Kneser graph when n = 2k +1. A long standing conjecture claims that O k is hamiltonian for all k>2. We show that the prism over O k is