Hamilton Cycle Decomposition of the Butterfly Network
Résumé
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and \linebreak \mbox{A.~Raspaud} who solved the case $d=3D2$.
Loading...