Rigid components in molecular graphs

DOI10.1007/S00453-007-0170-8zbMATH Open1127.05099OpenAlexW2010797427MaRDI QIDQ995776FDOQ995776

Authors: Bill Jackson, Tibor Jordán 

Publication date: 10 September 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-0170-8

Recommendations

• On the rigidity of molecular graphs
• Highly connected molecular graphs are rigid in three dimensions
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• A proof of the molecular conjecture
• A proof of the molecular conjecture

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cited In (11)

• The unassigned distance geometry problem
• A proof of the molecular conjecture
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• Minimal NMR distance information for rigidity of protein graphs
• Globally rigid powers of graphs
• Highly connected molecular graphs are rigid in three dimensions
• Brick partitions of graphs
• On the rigidity of molecular graphs
• Stability of \(\mathbb{Z}^2\) configurations in 3D
• Generic rigidity of molecular graphs via ear decomposition
• And yet it moves: paradoxically moving linkages in kinematics

This page was built for publication: Rigid components in molecular graphs

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