Compatible Hamilton decompositions of directed wrapped butterfly graphs Original Research Article

In this article we prove a conjecture of Bermond, Darrot, Delmas, and Perennes by constructing a Hamilton decomposition of the directed wrapped butterfly graph WBF (p, 2), where p is a prime greater than 3. This, together with results of Bermond et al., completes the proof that WBF (d, n) has a Hamilton decomposition for all d and n. We then construct p − 2 pairwise compatible Hamilton decompositions of WBF (p, 2).