Hamilton circuits in the directed wrapped Butterfly network (Q1392560): Difference between revisions

The authors prove that the wrapped Butterfly digraph of outdegree \(d\) and dimension \(n\) contains at least \(d-1\) arc-disjoint Hamilton directed cycles. They conjecture there is a Hamilton decomposition in all cases other than \(d=n=2\); \(d=2\) and \(n=3\); and \(d=3\) and \(n=2\). They offer strong evidence in support of the conjecture. Helen Verrall recently has completed the proof of the conjecture (Discrete Appl. Math., to appear).