✦ LIBER ✦

Disjoint Hamiltonian cycles in recursive circulant graphs

✍ Scribed by C. Micheneau

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 499 KB
Volume: 61
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00020-3

No coin nor oath required. For personal study only.

✦ Synopsis

We show in this paper that the circulant graph G( 2"', 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @

📜 SIMILAR VOLUMES

Disjoint Hamiltonian cycles in fan 2k-ty

Disjoint Hamiltonian cycles in fan 2k-type graphs

✍ Zhou Sanming 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract It is conjectured that a 2(__k__ + 1)‐connected graph of order __p__ contains __k__ + 1 pairwise disjoint Hamiltonian cycles if no two of its vertices that have degree less than 1/2 + 2__k__ are distance two apart. This is proved in detail for __k__ = 1. Similar arguments establish the

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 cycles in graphs

✍ Li Hao 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 419 KB

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__

Edge disjoint Hamilton cycles in graphs

✍ Guojun Li 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

Disjoint cycles in star-free graphs

✍ Markus, Lisa R.; Snevily, Hunter S. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB 👁 3 views

A graph is claw-free if it does not contain K l , 3 as an induced subgraph. It is Kl,,-free if it does not contain K l , r as an induced subgraph. We show that if a graph is Kl,,-free ( r 2 4), only p + 2r -1 edges are needed to insure that G has t w o disjoint cycles. As an easy consequence w e ge