When is a bipartite graph a rigid framework?
From MaRDI portal
Publication:1257913
DOI10.2140/pjm.1980.90.27zbMath0407.05078OpenAlexW1982700170MaRDI QIDQ1257913
Publication date: 1980
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1980.90.27
Related Items (31)
Bar-and-joint rigidity on the moment curve coincides with cofactor rigidity on a conic ⋮ Coincident rigidity of 2-dimensional frameworks ⋮ Bending of surfaces. II ⋮ Rigidity and polarity. II: Weaving lines and tensegrity frameworks ⋮ Dense graphs have rigid parts ⋮ Flexible circuits in the d‐dimensional rigidity matroid ⋮ Maximal matroids in weak order posets ⋮ Tensegrity Frameworks ⋮ New classes of counterexamples to Hendrickson's global rigidity conjecture ⋮ Infinitesimally Rigid Polyhedra. I. Statics of Frameworks ⋮ The orbit rigidity matrix of a symmetric framework ⋮ Rigidity and energy ⋮ Maximum likelihood threshold and generic completion rank of graphs ⋮ Invariant-theoretic methods in scene analysis and structural mechanics ⋮ Graph connectivity and universal rigidity of bar frameworks ⋮ Universal rigidity of complete bipartite graphs ⋮ On Some Problems in the Design of Plane Skeletal Structures ⋮ The Algebraic Geometry of Stresses in Frameworks ⋮ Global rigidity: The effect of coning ⋮ When does a planar bipartite framework admit a continuous deformation? ⋮ Rigid two-dimensional frameworks with three collinear points ⋮ On Graver's conjecture concerning the rigidity problem of graphs ⋮ Algebraic Matroids in Action ⋮ On the generic rigidity of bar-frameworks ⋮ GENERIC UNLABELED GLOBAL RIGIDITY ⋮ Structural topology, or the fine art of rediscovery ⋮ Projective background of the infinitesimal rigidity of frameworks ⋮ \(K_{5, 5}\) is fully reconstructible in \(\mathbb{C}^3\) ⋮ Some nonrealizable line diagrams ⋮ Rigid two-dimensional frameworks with two coincident points ⋮ Sufficient conditions for the global rigidity of graphs
This page was built for publication: When is a bipartite graph a rigid framework?
