A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A note on the cubical dimension of new classes of binary trees
2015
Czechoslovak Mathematical Journal
The cubical dimension of a graph G is the smallest dimension of a hypercube into which G is embeddable as a subgraph. The conjecture of Havel [On hamiltonian circuits and spanning trees of hypercubes. CasopisP est. Mat 109 (2) (1984) 135-152] claims that the cubical dimension of every balanced binary tree with 2 n vertices, n ≥ 1, is n. The 2-rooted complete binary tree of depth n is obtained from two copies of the complete binary tree of depth n by adding an edge linking their respective
doi:10.1007/s10587-015-0165-6
fatcat:4zdrilk6efcwjeult5b6gv6rga