Premium
Spanning caterpillars of a hypercube
Author(s) -
Dvořák Tomášk,
Havel Ivan,
Laborde JeanMarie,
Mollard Michel
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199701)24:1<9::aid-jgt2>3.0.co;2-v
Subject(s) - spanning tree , combinatorics , corollary , caterpillar , mathematics , conjecture , hypercube , minimum degree spanning tree , matroid , discrete mathematics , botany , biology , lepidoptera genitalia
Spanning trees of the hypercube Q n have been recently studied by several 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 Lewinter on the length of the spine of a caterpillar spanning Q n . © 1997 John Wiley & Sons, Inc.