Embedding of trees in euclidean spaces

It is proved that for any treeT the vertices ofT can be placed on the surface of a sphere inR3 in such a way that adjacent vertices have distance 1 and nonadjacent vertices have distances less than 1.

[1]  Hiroshi Maehara,et al.  Space graphs and sphericity , 1984, Discret. Appl. Math..

[2]  J. Reiterman,et al.  Embeddings of graphs in euclidean spaces , 1989, Discret. Comput. Geom..

[3]  Peter Frankl,et al.  The Johnson-Lindenstrauss lemma and the sphericity of some graphs , 1987, J. Comb. Theory B.

[4]  Hiroshi Maehara.  On the sphericity for the join of many graphs , 1984, Discret. Math..

[5]  Peter Frankl,et al.  Embedding the n-cube in Lower Dimensions , 1986, Eur. J. Comb..

[6]  Vojtech Rödl,et al.  Geometrical embeddings of graphs , 1989, Discret. Math..