Path: utzoo!attcan!uunet!mcsun!unido!pbinfo-n!pbinfo!wanka
From: wanka@pbinfo.UUCP (Rolf Wanka)
Newsgroups: comp.theory
Subject: Re: Cube-Connected Cycles
Summary: The problem is solved
Message-ID: <1055@pbinfo.UUCP>
Date: 1 Feb 90 16:12:47 GMT
References: <1046@pbinfo.UUCP> <1050@pbinfo.UUCP>
Reply-To: wanka@pbinfo.UUCP (Rolf Wanka)
Organization: Uni-GH Paderborn, Germany
Lines: 28


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
---------------------------------------------------------------------------