Compatible eulerian circuits in Kn∗∗

Hamilton circuits in the directed wrapped Butterfly network

“…Figure (6) shows one decomposition of B(3; 2) C4 into circuits. To produce a clearer gure, vertices ab on odd levels are ranked lexicographically and those on even levels in the following order: ab < a 0 b 0 if b < b 0 or b = b 0 and a < a 0 .…”

Covering 2-paths uniformly

“…For a selection of references, see [5] or [31]. The de Bruijn digraphs have the interesting property that LB Barth et al [3] took the ®rst step in this direction when they made the following conjecture about B F dY 1, which is isomorphic to K …”