Annex D - Abstract
------------------

Title: Hamilton cycle decomposition of the Butterfly network
Authors: BERMOND, Jean-Claude and DARROT, Eric and DELMAS, Olivier and
PERENNES, Stphane


In this paper, we prove that the wrapped Butterfly graph (undirected
graph) WBF(d,n) of degree d and dimension n is decomposable into
Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud
who solved the case d=2.

Key-words: Butterfly graph, graph theory, Hamilton decomposition,
Hamilton cycle, Hamilton circuit, perfect matching.


Annexe D - Rsum
-----------------

Titre: Dcomposition en cycles Hamiltoniens du rseau Butterfly
Auteurs: BERMOND, Jean-Claude and DARROT, Eric and DELMAS, Olivier and
PERENNES, Stphane


Dans cet article, nous prouvons que le graphe (non-orient) Butterfly
reboucl WBF(d,n) de degr d et de dimension n est dcomposable en
cycles Hamiltoniens. Ce rsultat rpond  une conjecture de D. Barth
et A. Raspaud qui ont rsolu le cas d=2.

Mots cls: graphe Butterfly, Thorie des graphes, dcomposition
Hamiltonienne, cycle Hamiltonien, circuit Hamiltonien, couplage
parfait.
