𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two edge-disjoint hamiltonian cycles in the butterfly graph

✍ Scribed by Dominique Barth; André Raspaud

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
493 KB
Volume
51
Category
Article
ISSN
0020-0190

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__

Disjoint Hamiltonian cycles in recursive
Disjoint Hamiltonian cycles in recursive circulant graphs
✍ C. Micheneau 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 499 KB

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. @

Edge-disjoint cycles in regular directed
Edge-disjoint cycles in regular directed graphs
✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996

Edge-disjoint paths and cycles in n-edge
Edge-disjoint paths and cycles in n-edge-connected graphs
✍ Andreas Huck 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 826 KB

## Abstract We consider finite undirected loopless graphs __G__ in which multiple edges are possible. For integers k,l ≥ 0 let g(k, l) be the minimal __n__ ≥ 0 with the following property: If __G__ is an __n__‐edge‐connected graph, __s__~1~, ⃛,__s__~k~, __t__~1~, ⃛,__t__~k~ are vertices of __G__, a