Embedding of trees in Euclidean spaces
From MaRDI portal
Publication:1100211
DOI10.1007/BF01864152zbMath0639.05017OpenAlexW2093754876MaRDI QIDQ1100211
Jan Reiterman, Vojtěch Rödl, Hiroshi Maehara, Edita Šiňajová
Publication date: 1988
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01864152
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Euclidean geometries (general) and generalizations (51M05)
Related Items (10)
The Johnson-Lindenstrauss lemma and the sphericity of some graphs ⋮ Unnamed Item ⋮ On threshold probabilities for the realization of a random graph by a geometric graph ⋮ The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ A note on vector representation of graphs ⋮ Unnamed Item ⋮ Sphericity, cubicity, and edge clique covers of graphs ⋮ Lower bounds for boxicity ⋮ Dispersed points and geometric embedding of complete bipartite graphs
Cites Work
This page was built for publication: Embedding of trees in Euclidean spaces