Abstract
It is proved that for any treeT the vertices ofT can be placed on the surface of a sphere inR 3 in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances less than 1.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Frankl, P., Maehara, H.: Embedding then-cube in lower dimensions. Europ. J. Comb.7, 221–225 (1986)
Frankl, P., Maehara, H.: The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory (B) (to appear)
Maehara, H.: Space graphs and sphericity. Discrete Appl. Math.49, 55–64 (1984)
Maehara, H.: On the sphericity for the join of many graphs. Discrete Math.7, 311–313 (1984)
Reiterman, J., Rödl, V., Šiňajová, E.: Geometrical embeddings of graphs. Discrete Math. (to appear)
Reiterman, J., Rödl, V., Šiňajová, E.: Embeddings of graphs in Euclidean spaces. Discrete & Computational Geometry (to appear)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maehara, H., Reiterman, J., Rödl, V. et al. Embedding of trees in euclidean spaces. Graphs and Combinatorics 4, 43–47 (1988). https://doi.org/10.1007/BF01864152
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01864152