Generic rigidity of molecular graphs via ear decomposition
From MaRDI portal
Recommendations
- Rigid components in molecular graphs
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity
- On the rigidity of molecular graphs
- Lower bounds on the number of realizations of rigid graphs
- The forcing polynomial of catacondensed hexagonal systems
- The number of embeddings of minimally rigid graphs
- scientific article; zbMATH DE number 5627530
- Cut-edges and the independence number
- On polyhedron graph density in problems of combinatorial optimization
- Isostatic block and hole frameworks
Cites work
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 3953697 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- Combinatorial Algorithm for a Lower Bound on Frame Rigidity
- Conditions for Unique Graph Realizations
- Ear decomposition with bounds on ear length
- HANS BETHE'S CONTRIBUTIONS TO SOLID-STATE PHYSICS
- Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
- On graphs and rigidity of plane skeletal structures
- The Algebraic Geometry of Stresses in Frameworks
- The Union of Matroids and the Rigidity of Frameworks
Cited in
(2)
This page was built for publication: Generic rigidity of molecular graphs via ear decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975368)