Realizability of graphs in three dimensions

Discrete and Computational Geometry

Volumn 37, Issue 2, 2007, Pages 139-162

  Belk, Maria ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33847322118     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1285-4     Document Type: Article

References (9)

1. Belk, Maria; Connelly, Robert, Realizability of graphs, Discrete Comput. Geom., this issue, pp. 125-137.
2. Bezdek, Karoly; Connelly, Robert, Two-distance preserving function from Euclidean space. Discrete geometry and rigidity (Budapest, 1999). Period. Math Hungar: 39(1-3), (1999), 185-200, MR1783825.
3. Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, 10, Springer-Verlag, Berlin, 2003, MR1998147.
4. Connelly, Robert, Rigidity and energy, Invent. Math. 66(1) (1982), 11-33, MR0652643.
5. Connelly, Robert; Whiteley, Walter, Second-order rigidity and prestress stability for tensegrity frameworks, SIAM J. Discrete Math. 9(3) (1996), 453-491, MR1402190.
6. Diestel, Reinhard, Graph Theory, second edition, Graduate Texts in Mathematics, 173, Springer-Verlag, New York, 2000, MR1743598.
7. Maple 8 for Linux, Maplesoft Inc., http://www.maplesoft.com.
8. Rudin, Walter, Principles of Mathematical Analysis, third edition, International Series in Pure and Applied Mathematics, McGraw Hill, New York, 1976, MR0385023.
9. Roth, Ben; Whiteley, Walter, Tensegrity frameworks, Trans. Amer. Math. Soc. 265(2) (1981), 419-446, MR0610958.