Realizability of graphs

DOI10.1007/S00454-006-1284-5MaRDI QIDQ878072zbMATH OpenOpenAlexFDO

Authors Maria Belk, Robert Connelly

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

zbMATH Keywords

minorconfiguration

Mathematics Subject Classification ID

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

Recommendations

• Realizability of graphs in three dimensions
• The Gram dimension of a graph
• Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs))
• Realizability of graphs and linkages
• scientific article; zbMATH DE number 125456

Cited in

(31)

• scientific article; zbMATH DE number 3843805 (Why is no real title available?)
• The realizable extension problem and the weighted graph \((K _{3,3}, l)\)
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Unavoidable minors for graphs with large \(\ell_p\)-dimension
• Euclidean distance matrices and applications
• Constructing uniquely realizable graphs
• The Gram dimension of a graph
• Selected open problems in discrete geometry and optimization
• Series parallel linkages
• Zur Struktur der (\({\mathfrak P}^ 3\))-realisierbaren Graphen. (On the structure of (\({\mathfrak P}^ 3\)-realizable graphs))
• On (1, 2)-realizable graphs
• scientific article; zbMATH DE number 975398 (Why is no real title available?)
• scientific article; zbMATH DE number 1439420 (Why is no real title available?)
• Realizability of graphs in three dimensions
• Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
• Graph-theoretical conditions for inscribability and Delaunay realizability
• Iterative universal rigidity
• Realizability of graphs and linkages
• Complexity of the positive semidefinite matrix completion problem with a rank constraint
• Feasible graphs with standard universe
• Realizability and verification of MSC graphs
• The plane-width of graphs
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
• The excluded minors for isometric realizability in the plane
• Realizability and uniqueness in graphs
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Edge covers of caterpillars, cycles with pendants, and spider graphs
• Realizability of Graphs as Triangle Cover Contact Graphs
• Characterizing graphs with convex and connected Cayley configuration spaces
• The rotational dimension of a graph
• Super stable tensegrities and the Colin de Verdière number \(\nu\)

This page was built for publication: Realizability of graphs

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