Realizability of graphs
From MaRDI portal
Publication:878072
DOI10.1007/s00454-006-1284-5zbMath1114.05067OpenAlexW2072645091MaRDI QIDQ878072
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-1284-5
Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (16)
The rotational dimension of a graph ⋮ Characterizing graphs with convex and connected Cayley configuration spaces ⋮ The realizable extension problem and the weighted graph \((K _{3,3}, l)\) ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ The Excluded Minors for Isometric Realizability in the Plane ⋮ Unnamed Item ⋮ Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian ⋮ A new graph parameter related to bounded rank positive semidefinite matrix completions ⋮ Series parallel linkages ⋮ 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 ⋮ The plane-width of graphs ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Selected Open Problems in Discrete Geometry and Optimization ⋮ Iterative universal rigidity
This page was built for publication: Realizability of graphs
