Realizability of Graphs

  title={Realizability of Graphs},
  author={Maria Belk and Robert Connelly},
  journal={Discrete & Computational Geometry},
A graph is d-realizable if, for every configuration of its vertices in E N , there exists a another corresponding configuration in Ed with the same edge lengths. A graph is 2-realizable if and only if it is a partial 2-tree, i.e., a subgraph of the 2-sum of triangles in the sense of graph theory. We show that a graph is 3-realizable if and only if it does not have K5 or the 1-skeleton of the octahedron as a minor. 

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 29 extracted citations


Publications referenced by this paper.
Showing 1-10 of 23 references

Realizability of Graphs in Three Dimensions

Discrete & Computational Geometry • 2007

Graph minors. XX

Neil Robertson, P. D. Seymour
Wagner’s conjecture, J. Combin. Theory Ser. B • 2004

Metric embeddings—beyond one-dimensional distortion, Discrete Comput. Geom

Robert KLM Krauthgamer, Nathan Linial, Avner Magen

Graph Theory, second edition, Graduate Texts

Diestel, Reinhard

On the embeddability of weighted graphs in euclidean spaces, Research report

Abdo Y. AW Alfakih, Henry Wolkowicz
CORR 98-12, • 1998

Geometry of Cuts and Metrics

Michel Marie DL Deza, Monique Laurent
Algorithms and Combinatorics, • 1997

Similar Papers

Loading similar papers…