Realizable dimension of periodic frameworks
From MaRDI portal
Cites work
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- A semidefinite programming approach to tensegrity theory and realizability of graphs
- Affine rigidity and conics at infinity
- Depth-First Search and Linear Graph Algorithms
- Excluding a group-labelled graph
- Generic combinatorial rigidity of periodic frameworks
- Generic rigidity with forced symmetry and sparse colored graphs
- Global rigidity of periodic graphs under fixed-lattice representations
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- On Flattenability of Graphs
- Periodic frameworks and flexibility
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Realizability of graphs
- Realizability of graphs in three dimensions
- Rigidity and energy
- The excluded minors for isometric realizability in the plane
- Theory of semidefinite programming for sensor network localization
This page was built for publication: Realizable dimension of periodic frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869860)