Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures

DOI10.1007/BF01788678zbMath0721.05054OpenAlexW2009251274MaRDI QIDQ2640622

Tiong Seng Tay

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788678

zbMATH Keywords

rigiditymultigraphsframeworkbody structurehinge structure

Mathematics Subject Classification ID

Applications of graph theory (05C90)

Related Items (18)

Sparse Graphs and an Augmentation Problem ⋮ Globally Rigid Augmentation of Rigid Graphs ⋮ An inductive construction of minimally rigid body-hinge simple graphs ⋮ Linking rigid bodies symmetrically ⋮ Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs ⋮ Exploring the rigidity of planar configurations of points and rods ⋮ Generic global rigidity of body-hinge frameworks ⋮ Linking \((n-2)\)-dimensional panels in \(n\)-space. I: \((k-1,k)\)-graphs and \((k-1,k)\)-frames ⋮ Graded sparse graphs and body-length-direction frameworks ⋮ A rooted-forest partition with uniform vertex demand ⋮ The generic rank of body-bar-and-hinge frameworks ⋮ A proof of the molecular conjecture ⋮ On the generic rigidity of bar-frameworks ⋮ On the rigidity of molecular graphs ⋮ WELL-FORMED SYSTEMS OF POINT INCIDENCES FOR RESOLVING COLLECTIONS OF RIGID BODIES ⋮ An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs ⋮ A new proof of Laman's theorem ⋮ Sufficient conditions for the global rigidity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
• On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory

This page was built for publication: Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures