The following pages link to Realizability of graphs (Q878072):
Displaying 15 items.
- Series parallel linkages (Q555265) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- The realizable extension problem and the weighted graph \((K _{3,3}, l)\) (Q1928599) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Iterative universal rigidity (Q2351022) (← links)
- Characterizing graphs with convex and connected Cayley configuration spaces (Q2380778) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- Selected Open Problems in Discrete Geometry and Optimization (Q2849006) (← links)
- The Excluded Minors for Isometric Realizability in the Plane (Q2968517) (← links)
- The plane-width of graphs (Q3096959) (← links)
- The rotational dimension of a graph (Q3168659) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
