wanka@pbinfo.UUCP (Rolf Wanka) (02/02/90)
Hello,
the question, where to find the statement that the Cube-Connected
Cycles network has an Hamiltonian cycle, is answered.
References are:
- A. M. Schwartz and M. C. Loui,
Dictionary machines on cube-class networks,
IEEE Transactions on Computers,
vol. C-36, no. 1, pp. 100-105, January 1987.
- T. Leighton, Lecture Notes (MIT)
My very special thanks to Walter Hohberg (University of Dortmund, FRG)
who found a beautyful construction, and M. C. Loui (University of
Illinois, Urbana, USA).
Rolf Wanka
---------------------------------------------------------------------------
UUCP: wanka@pbinfo.UUCP | Rolf Wanka
or wanka@pbinfo.uni-paderborn.de | Universitaet-GH Paderborn
or ...!uunet!unido!pbinfo!wanka | Fachbereich 17-Mathematik/Informatik
CSNET: wanka%pbinfo.uucp@Germany.CSNET | Warburger Str. 100
ARPA: wanka@pbinfo.uni-paderborn.de | D-4790 Paderborn, West Germany
---------------------------------------------------------------------------