A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
From MaRDI portal
Publication:1405103
DOI10.1016/S0095-8956(02)00037-0zbMath1036.05047MaRDI QIDQ1405103
Publication date: 25 August 2003
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
1-EXTENSIONS AND GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS ⋮ Self-dual polyhedra of given degree sequence ⋮ Geometry of configuration spaces of tensegrities ⋮ On constructive characterizations of \((k,l)\)-sparse graphs ⋮ Phase retrieval of complex and vector-valued functions ⋮ Addressing agent loss in vehicle formations and sensor networks ⋮ Robust tensegrity polygons ⋮ Generically globally rigid graphs have generic universally rigid frameworks ⋮ Good orientations of unions of edge‐disjoint spanning trees ⋮ A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid ⋮ Flexible circuits in the d‐dimensional rigidity matroid ⋮ Good acyclic orientations of 4‐regular 4‐connected graphs ⋮ Boundedness, rigidity and global rigidity of direction-length frameworks ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ Four-regular graphs with extremal rigidity properties ⋮ Balanced generic circuits without long paths ⋮ Unnamed Item ⋮ Global rigidity of periodic graphs under fixed-lattice representations ⋮ Equivalent realisations of a rigid graph ⋮ Periodic rigidity on a variable torus using inductive constructions ⋮ Globally rigid circuits of the direction-length rigidity matroid ⋮ Global rigidity: The effect of coning ⋮ Combinatorial characterization of the Assur graphs from engineering ⋮ Rigidity, global rigidity, and graph decomposition ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Connected rigidity matroids and unique realizations of graphs ⋮ OPERATIONS PRESERVING GLOBAL RIGIDITY OF GENERIC DIRECTION-LENGTH FRAMEWORKS ⋮ Combining globally rigid frameworks ⋮ Assur decompositions of direction-length frameworks ⋮ Rigid tensegrity labelings of graphs ⋮ Globally Linked Pairs of Vertices in Rigid Frameworks ⋮ One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory ⋮ Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids ⋮ Sufficient conditions for the global rigidity of graphs ⋮ Inductive constructions for frameworks on a two-dimensional fixed torus
Cites Work
