Realizability of graphs

Discrete and Computational Geometry

Volumn 37, Issue 2, 2007, Pages 125-137

  Belk, Maria ^a   Connelly, Robert ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33847270802     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1284-5     Document Type: Article

References (22)

1. Arnborg, Stefan; Proskurowski, Andrzej; Cornell, Derek G., Forbidden minors characterization of partial 3-trees, Discrete Math. 80(1) (1990), 1-19, MR1045920.
2. Alfakih, Abdo Y.; Wolkowicz, Henry, On the embeddability of weighted graphs in euclidean spaces, Research report CORK 98-12, University of Waterloo, 1998.
3. Barvinok, Alexander I., Problems of distance geometry and convex properties of quadratic maps, Discrete Comput. Geom. 13(2) (1995), 189-202, MR1314962.
4. Barvinok, Alexander, A remark on the rank of positive semidefinite matrices subject to affine constraints, Discrete Comput. Geom. 25(1) (2001), 23-31, MR1797294.
5. Basu, Saugata; Pollack, Richard; Roy, Marie-Françoise, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, 10, Springer-Verlag, Berlin, 2003, MR1998147.
6. Crippen, G. M.; Havel, T. F., Distance Geometry and Molecular Conformation, Chemometrics Series, 15, Research Studies Press, Chichester; Wiley, Inc., New York, 1988, MR0975025.
7. Diestel, Reinhard, Graph Theory, second edition, Graduate Texts in Mathematics, 173, Springer-Verlag, New York, 2000, MR1743598.
8. Deza, Michel Marie; Laurent, Monique, Geometry of Cuts and Metrics, Algorithms and Combinatorics, 15, Springer-Verlag, Berlin, 1997, MR1460488.
9. Hendrickson, Bruce, The molecule problem: exploiting structure in global optimization, SIAM J. Optim. 5(4) (1995), 835-857, MR1358807.
10. Krauthgamer, Robert; Linial, Nathan; Magen, Avner, Metric embeddings - beyond one-dimensional distortion, Discrete Comput. Geom. 31(3) (2004), 339-356.
11. Laurent, Monique, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, in Topics in Semidefinite. and Interior-Point Methods (Toronto, ON, 1996), pp. 51-76, Fields Institute Communications, 18, American Mathematical Society, Providence, RI, 1998, MR1607310.
12. Laurent, Monique, On the sparsity order of a graph and its deficiency in chordality, Combinatorica 21(4) (2001), 543-570, MR1863577
13. Matoušek, Jiří; Thomas, Robin, Algorithms finding tree-decompositions of graphs, J. Algorithms 12(1) (1991), 1-22, MR1088113.
14. Reed, B. A., Tree width and tangles: a new connectivity measure and some applications, in Surveys in Combinatorics, 1997 (London), pp. 87-162, London Mathematical Society Lecture Note Series, 241, Cambridge University Press, Cambridge. 1997, MR1477746.
15. Robertson, Neil; Seymour, P. D., Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms 7(3) (1986), 309-322, MR0855559.
16. Robertson, Neil; Seymour, P. D., Graph minors. XX. Wagner's conjecture, J. Combin. Theory Sci: B 92(2) (2004), MR2099147.
17. Sanders, Daniel P., Linear algorithms for graphs of tree-width at most four, Ph.D. thesis, Georgia Tech, Atlanta, GA, 1993.
18. Sanders, Daniel P., On linear recognition of tree-width at most four, SIAM J. Discrete Math. 9(1) (1996), 101-117, MR1375418.
19. Seymour, P. D., Decomposition of regular matroids, J. Combin. Theory Ser. B 28(3) (1980), MR0579077.
20. Sloughter, Maria, Realizability of graphs in three dimensions, Preprint, 2004.
21. Thomas, Robin, Recent excluded minor theorems for graphs, in Surveys in Combinatorics, 1999 (Canterbury), pp. 201-222, London Mathematical Society Lecture Note Series, 267, Cambridge University Press, Cambridge, 1999, MR1725004.
22. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570-590.