Rigidity, global rigidity, and graph decomposition

DOI10.1016/J.EJC.2009.11.022MaRDI QIDQ973100zbMATH OpenOpenAlexFDO

Authors Brigitte Servatius, Herman J. 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 representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Recommendations

• A sufficient connectivity condition for generic rigidity in the plane
• The 2-dimensional rigidity of certain families of graphs
• Sufficient conditions for 2-dimensional global rigidity
• Birigidity in the Plane
• The d-dimensional rigidity matroid of sparse graphs

Cites work

• A Combinatorial Decomposition Theory
• A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
• Algorithms for graph rigidity and scene analysis
• Birigidity in the Plane
• Connected rigidity matroids and unique realizations of graphs
• Connectivity in Matroids
• Dividing a Graph into Triconnected Components
• Globally linked pairs of vertices in equivalent realizations of graphs
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 863470 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• Matroid theory and its applications in electric network theory and in statics
• On Generic Rigidity in the Plane
• Pebble game algorithms and sparse graphs
• The number of embeddings of minimally rigid graphs
• The structure of locally finite two-connected graphs

Cited in

(14)

• Rigid tensegrity labelings of graphs
• Cuts, matrix completions and graph rigidity
• The kinematics of a framework presented by H. Harborth and M. Möller
• Graph rigidity via Euclidean distance matrices
• Globally rigid powers of graphs
• On the 2-sum in rigidity matroids
• Global rigidity of triangulations with braces
• Birigidity in the Plane
• A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
• Universal rigidity of complete bipartite graphs
• Global Rigidity of Unit Ball Graphs
• Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
• Operations preserving the global rigidity of graphs and frameworks in the plane
• Globally rigid circuits of the direction-length rigidity matroid

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973100)