On the rigidity of molecular graphs

DOI10.1007/s00493-008-2287-zzbMath1199.52036OpenAlexW2043683546MaRDI QIDQ1046739

Tibor Jordán, Bill Jackson

Publication date: 28 December 2009

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2287-z

zbMATH Keywords

rigidity of graphsmolecular conjecture

Mathematics Subject Classification ID

Applications of graph theory (05C90) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items (6)

Globally rigid powers of graphs ⋮ Highly connected molecular graphs are rigid in three dimensions ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ Combinatorial models of rigidity and renormalization ⋮ Pin-collinear body-and-pin frameworks and the molecular conjecture ⋮ A proof of the molecular conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• Brick partitions of graphs
• The generic rank of body-bar-and-hinge frameworks
• Rigid components in molecular graphs
• Generic rigidity of molecular graphs via ear decomposition
• The Dress conjectures on rank in the 3-dimensional rigidity matroid
• The \(d\)-dimensional rigidity matroid of sparse graphs
• 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
• ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
• The Union of Matroids and the Rigidity of Frameworks
• Generic rigidity in three-dimensional bond-bending networks
• Combinatorial Algorithm for a Lower Bound on Frame Rigidity

This page was built for publication: On the rigidity of molecular graphs