Realizability of graphs in three dimensions
From MaRDI portal
Recommendations
Cited in
(17)- The Gram dimension of a graph
- The complexity of the Hausdorff distance
- Realizability of Graphs as Triangle Cover Contact Graphs
- Selected open problems in discrete geometry and optimization
- Realizability of graphs
- Characterizing graphs with convex and connected Cayley configuration spaces
- Graph-theoretical conditions for inscribability and Delaunay realizability
- Realization of graphs in the space of bounded height
- The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
- Unavoidable minors for graphs with large \(\ell_p\)-dimension
- The excluded minors for isometric realizability in the plane
- Euclidean distance matrices and applications
- Complexity of the positive semidefinite matrix completion problem with a rank constraint
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- On Flattenability of Graphs
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)