Realizability of graphs in three dimensions
From MaRDI portal
Publication:878073
DOI10.1007/s00454-006-1285-4zbMath1114.05066OpenAlexW2045398234MaRDI QIDQ878073
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
Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
On Flattenability of Graphs ⋮ Characterizing graphs with convex and connected Cayley configuration spaces ⋮ The complexity of the Hausdorff distance ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ The Excluded Minors for Isometric Realizability in the Plane ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ Euclidean Distance Matrices and Applications ⋮ Unavoidable minors for graphs with large \(\ell_p\)-dimension ⋮ Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Selected Open Problems in Discrete Geometry and Optimization
