A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid
- 1 May 2003
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 88 (1) , 77-97
- https://doi.org/10.1016/s0095-8956(02)00037-0
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Some matroids from discrete applied geometryPublished by American Mathematical Society (AMS) ,1996
- Matroids and Rigid StructuresPublished by Cambridge University Press (CUP) ,1992
- Conditions for Unique Graph RealizationsSIAM Journal on Computing, 1992
- Linking (n − 2)-dimensional panels inn-space I: (k − 1,k)-graphs and (k − 1,k)-framesGraphs and Combinatorics, 1991
- On generic global rigidityPublished by American Mathematical Society (AMS) ,1991
- Rigidity and energyInventiones Mathematicae, 1982
- On graphs and rigidity of plane skeletal structuresJournal of Engineering Mathematics, 1970
- On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphsPublished by Springer Nature ,1969