Realizability of graphs in three dimensions

DOI10.1007/S00454-006-1285-4zbMATH Open1114.05066OpenAlexW2045398234MaRDI QIDQ878073FDOQ878073

Maria Belk

Publication date: 26 April 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-006-1285-4

Recommendations

• Realizability of graphs
• The Gram dimension of a graph
• Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs))
• Realization of knots and links in a spatial graph
• Connected rigidity matroids and unique realizations of graphs

zbMATH Keywords

configurationminors

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph minors (05C83)

Cited In (14)

• Euclidean Distance Matrices and Applications
• Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint
• The complexity of the Hausdorff distance
• Realizability of Graphs as Triangle Cover Contact Graphs
• Characterizing graphs with convex and connected Cayley configuration spaces
• Graph-theoretical conditions for inscribability and Delaunay realizability
• Selected Open Problems in Discrete Geometry and Optimization
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
• The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Unavoidable minors for graphs with large \(\ell_p\)-dimension
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• On Flattenability of Graphs
• The Excluded Minors for Isometric Realizability in the Plane

This page was built for publication: Realizability of graphs in three dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878073)