One‐legged caterpillars span hypercubes
- 1 March 1986
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 10 (1) , 69-77
- https://doi.org/10.1002/jgt.3190100110
Abstract
The aim of this paper is to prove that any balanced caterpillar having 2n vertices and maximum degree 3 spans the n‐dimensional hypercube.Keywords
This publication has 4 references indexed in Scilit:
- On Hamiltonian circuits and spanning trees of hypercubesČasopis pro pěstování matematiky, 1984
- On cubes and dichotomic treesČasopis pro pěstování matematiky, 1974
- The number of caterpillarsDiscrete Mathematics, 1973
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969