✦ LIBER ✦

Random partitions and edge-disjoint Hamiltonian cycles

✍ Scribed by Hartke, Stephen G.; Seacrest, Tyler

Book ID: 123522785
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 478 KB
Volume: 103
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2013.09.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-disjoint Hamiltonian cycles in hype

Edge-disjoint Hamiltonian cycles in hypertournaments

✍ Vojislav Petrovic; Carsten Thomassen 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB

## Abstract We introduce a method for reducing __k__‐tournament problems, for __k__ ≥ 3, to ordinary tournaments, that is, 2‐tournaments. It is applied to show that a __k__‐tournament on __n__ ≥ k + 1 + 24__d__ vertices (when __k__ ≥ 4) or on __n__ ≥ 30__d__ + 2 vertices (when __k__ = 3) has __d__

Two edge-disjoint hamiltonian cycles in

Two edge-disjoint hamiltonian cycles in graphs

✍ Mingchu Li 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 548 KB

Edge-Disjoint Hamiltonian Paths and Cycl

Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

✍ Thomassen, C. 📂 Article 📅 1982 🏛 Oxford University Press 🌐 English ⚖ 445 KB

Generalized Hypercubes: Edge-Disjoint Ha

Generalized Hypercubes: Edge-Disjoint Hamiltonian Cycles and Gray Codes

✍ Hussain, Zaid A.; Bose, Bella; Al-Dhelaan, Abdullah 📂 Article 📅 2014 🏛 IEEE 🌐 English ⚖ 721 KB

Two edge-disjoint hamiltonian cycles in

Two edge-disjoint hamiltonian cycles in the butterfly graph

✍ Dominique Barth; André Raspaud 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 493 KB

Edge disjoint Hamiltonian cycles in k-ar

Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes

✍ Bae, M.M.; Bose, B. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 580 KB