Sufficient conditions for the global rigidity of graphs
From MaRDI portal
Publication:2347845
DOI10.1016/j.jctb.2015.01.003zbMath1315.05039arXiv1403.3742OpenAlexW2124036733MaRDI QIDQ2347845
Publication date: 10 June 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.3742
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices, Globally rigid powers of graphs, Unique low rank completability of partially filled matrices, Equivalence of continuous, local and infinitesimal rigidity in normed spaces, Redundantly globally rigid braced triangulations, Sharp threshold for rigidity of random graphs, Ear‐decompositions, minimally connected matroids and rigid graphs, Generic global rigidity of body-hinge frameworks, Enumerating Grid Layouts of Graphs, Global rigidity of periodic graphs under fixed-lattice representations, Minimum size highly redundantly rigid graphs in the plane, Sufficient conditions for the global rigidity of periodic graphs, Extremal families of redundantly rigid graphs in three dimensions, Minimally globally rigid graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of the molecular conjecture
- New classes of counterexamples to Hendrickson's global rigidity conjecture
- Combining globally rigid frameworks
- Global rigidity: The effect of coning
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Rigidity and energy
- Linking \((n-2)\)-dimensional panels in \(n\)-space. I: \((k-1,k)\)-graphs and \((k-1,k)\)-frames
- When is a bipartite graph a rigid framework?
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Constructive characterizations for packing and covering with trees
- Connected rigidity matroids and unique realizations of graphs
- Independence and port oracles for matroids, with an application to computational learning theory
- Generic global rigidity
- Globally linked pairs of vertices in equivalent realizations of graphs
- On graphs and rigidity of plane skeletal structures
- Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
- Birigidity in the Plane
- Characterizing generic global rigidity
- The Union of Matroids and the Rigidity of Frameworks
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- Generic Rigidity Matroids with Dilworth Truncations
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
