Spanning trees of the hypercube Q(n) have been recently studied by sev
eral authors. In this paper, we construct spanning trees of Q(n) which
are caterpillars and establish quantitative bounds for a caterpillar
to span Q(n). As a corollary, we disprove a conjecture of Harary and L
ewinter on the length of the spine of a caterpillar spanning Q(n). (C)
1997 John Wiley & Sons, Inc.