J.P.D. Kooij <PICLIST@MITVMA.MIT.EDU> wrote:

> [a long description of Hamilton cycles on n-dimensional cubes and
> their relationship to Gray codes, including the following lines]
>
> A Hamiltonian cycle would be:
> 000 -> 100 -> 110 -> 010 -> 011 -> 111 -> 101 -> 001 (-> 000 )

Joost:

While every n-bit Gray code describes a Hamilton cycle over an
n-dimensional cube, the converse is nut true; every Hamilton cycle
over that cube does NOT describe a Gray code.

While many Hamilton cycles over your example 3-dimensional cube are
possible, only ONE of them is the 3-bit Gray code (and the example
you showed, by the way, isn't it).

-Andy

=== Andrew Warren - fastfwd@ix.netcom.com                 ===
=== Fast Forward Engineering - Vista, California          ===
===                                                       ===
=== Custodian of the PICLIST Fund -- For more info, see:  ===
=== http://www.geocities.com/SiliconValley/2499/fund.html ===