zbMATH — the first resource for mathematics

One-legged caterpillars span hypercubes. (English) Zbl 0589.05031
A caterpillar is a tree with at least three vertices, which after removal of the end vertices and incident edges reduces to a snake or a simple vertex. A connected bipartite graph is called balanced if each part contains half of all vertices. It is shown that any balanced caterpillar having \(2^ n\) vertices and maximum degree 3 spans the n-dimensional hypercube.
Reviewer: P.Kirschenhofer

05C05 Trees
Full Text: DOI
[1] Graph Theory. Addison-Wesley, Reading, MA (1969).
[2] Harary, Discrete Math. 6 pp 359– (1973)
[3] Havel, Čas. Pěst. Mat. 109 pp 135– (1984)
[4] Nebeský, Čas. Pěst. Mat. 99 pp 164– (1974)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.