On the rigidity of molecular graphs
From MaRDI portal
Recommendations
Cites work
- Brick partitions of graphs
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity
- Edge-Disjoint Spanning Trees of Finite Graphs
- Generic rigidity in three-dimensional bond-bending networks
- Generic rigidity of molecular graphs via ear decomposition
- scientific article; zbMATH DE number 3859878 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- 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
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- Rigid components in molecular graphs
- The d-dimensional rigidity matroid of sparse graphs
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- The generic rank of body-bar-and-hinge frameworks
- The Union of Matroids and the Rigidity of Frameworks
Cited in
(11)- Minimal NMR distance information for rigidity of protein graphs
- Generic rigidity of molecular graphs via ear decomposition
- Generic rigidity of square grid graph
- Globally rigid powers of graphs
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
- Highly connected molecular graphs are rigid in three dimensions
- A proof of the molecular conjecture
- Combinatorial models of rigidity and renormalization
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- Rigid components in molecular graphs
This page was built for publication: On the rigidity of molecular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046739)