From: rdd@minster.york.ac.uk
Newsgroups: sci.math
Subject: Tours on a hypercube. How many?
Date: 3 Feb 1995 11:19:15 GMT

The problem described below has been taunting me for
some while now. If someone could help me to put it
to rest I'd be grateful indeed.

The problem: How many distinct tours are there over
an n-cube C. A tour is a sequence T of vertices s.t.

1. Consecutive elements of T are adjacent on C.
2. Each vertex from C occurs in T exactly once.

Thanks,

R.