Highly connected molecular graphs are rigid in three dimensions

DOI10.1016/j.ipl.2012.01.013zbMath1243.05067OpenAlexW2066198491MaRDI QIDQ436325

Tibor Jordán

Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.013

zbMATH Keywords

rigid graphscomputational geometryvertex connectivitycombinatorial rigiditymolecular graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)

Related Items (1)

Globally rigid powers of graphs

Cites Work

• A proof of the molecular conjecture
• Brick partitions of graphs
• Rigid components in molecular graphs
• A sufficient connectivity condition for generic rigidity in the plane
• On the rigidity of molecular graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The 2-dimensional rigidity of certain families of graphs
• On Generic Rigidity in the Plane
• Unnamed Item
• Unnamed Item

This page was built for publication: Highly connected molecular graphs are rigid in three dimensions