Hamilton Cycle Decomposition of the Butterfly Network
J. -C. Bermond, Éric Darrot, Olivier Delmas, Stéphane Pérennès · Parallel Processing Letters · 1998
In this paper, we prove that the wrapped Butterfly graph WBF(d,n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of Barth and Raspaud who solved the case d = 2.