An inductive construction of minimally rigid body-hinge simple graphs

DOI10.1016/j.tcs.2014.08.007zbMath1339.05335OpenAlexW2036467172MaRDI QIDQ300212

Naoyuki Kamiyama, Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.007

zbMATH Keywords

infinitesimal rigiditybody-hinge frameworkbody-hinge graphpanel-hinge frameworkrigid realization

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• A proof of the molecular conjecture
• Rigidity of multi-graphs. I: Linking rigid bodies in n-space
• Constructive characterizations for packing and covering with trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Pebble game algorithms and sparse 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
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The Union of Matroids and the Rigidity of Frameworks
• Unnamed Item
• Unnamed Item

This page was built for publication: An inductive construction of minimally rigid body-hinge simple graphs