Rigidity, global rigidity, and graph decomposition

DOI10.1016/J.EJC.2009.11.022zbMath1191.05069OpenAlexW2010025666MaRDI QIDQ973100

Herman J. Servatius, Brigitte Servatius

Publication date: 28 May 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.022

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs ⋮ The kinematics of a framework presented by H. Harborth and M. Möller ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid theory and its applications in electric network theory and in statics
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Connected rigidity matroids and unique realizations of graphs
• The number of embeddings of minimally rigid graphs
• The structure of locally finite two-connected graphs
• Pebble game algorithms and sparse graphs
• Globally linked pairs of vertices in equivalent realizations of graphs
• Birigidity in the Plane
• A Combinatorial Decomposition Theory
• On Generic Rigidity in the Plane
• Dividing a Graph into Triconnected Components
• Connectivity in Matroids
• Algorithms - ESA 2003

This page was built for publication: Rigidity, global rigidity, and graph decomposition