On Generic Rigidity in the Plane
From MaRDI portal
Publication:3960720
Cites work
- scientific article; zbMATH DE number 3887796 (Why is no real title available?)
- scientific article; zbMATH DE number 3848132 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- Decomposition of Finite Graphs Into Forests
- Minimum partition of a matroid into independent subsets
- On graphs and rigidity of plane skeletal structures
- The Rigidity of Graphs
- The rigidity of graphs. II
Cited in
(87)- Coincident rigidity of 2-dimensional frameworks
- Singular spaces of matrices and their application in combinatorics
- Rigidity, global rigidity, and graph decomposition
- Infinitesimal Rigidity in Normed Planes
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- A combinatorial study of the rigidity of planar structures
- Flexible circuits in the d‐dimensional rigidity matroid
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
- Highly connected molecular graphs are rigid in three dimensions
- Isostatic bar and joint frameworks in the plane with irreducible pure conditions
- Minimally globally rigid graphs
- On characterizations of rigid graphs in the plane using spanning trees
- Pin-collinear body-and-pin frameworks and the molecular conjecture
- The parity problem of polymatroids without double circuits
- Cuts, matrix completions and graph rigidity
- Operations preserving global rigidity of generic direction-length frameworks
- Matroids of gain graphs in applied discrete geometry
- The number of realizations of a Laman graph
- Forests, frames, and games: Algorithms for matroid sums and applications
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- Applications of combinatorics to statics --- a second survey
- Globally rigid circuits of the direction-length rigidity matroid
- Generically globally rigid zeolites in the plane
- Boundedness, rigidity and global rigidity of direction-length frameworks
- Graph rigidity via Euclidean distance matrices
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Source location with rigidity and tree packing requirements
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
- Symmetric versions of Laman's theorem
- Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid
- Packing of rigid spanning subgraphs and spanning trees
- Bounded direction-length frameworks
- Sparse hypergraphs with applications in combinatorial rigidity
- A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- Efficient computation of implicit representations of sparse graphs
- Generalized polymatroids and submodular flows
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
- Symmetric isostatic frameworks with \(\ell^1\) or \(\ell^\infty\) distance constraints
- Spectral conditions for graph rigidity in the Euclidean plane
- Pebble game algorithms and sparse graphs
- A sufficient connectivity condition for generic rigidity in the plane
- Rigid two-dimensional frameworks with two coincident points
- Algebraic matroids in action
- Tensegrity frameworks in one-dimensional space
- Sufficient connectivity conditions for rigidity of symmetric frameworks
- Metric graphs elastically embeddable in the plane
- On the two-dimensional generic rigidity matroid and its dual
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- The \(d\)-dimensional rigidity matroid of sparse graphs
- Connected rigidity matroids and unique realizations of graphs
- \(k\)-plane matroids and Whiteley's flattening conjectures
- Sparse hypergraphs and pebble game algorithms
- Equivalent realisations of a rigid graph
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Maxwell-Laman counts for bar-joint frameworks in normed spaces
- DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
- Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method
- On combinatorial structures of line drawings of polyhedra
- Bending of surfaces. II
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
- The reachability problem in constructive geometric constraint solving based dynamic geometry
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Matroid matching with Dilworth truncation
- Searching the solution space in constructive geometric constraint solving with genetic algorithms
- Frameworks with Coordinated Edge Motions
- Graph reconstruction from unlabeled edge lengths
- Generic symmetry-forced infinitesimal rigidity: translations and rotations
- Rigidity of frameworks on expanding spheres
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- Graph rigidity for unitarily invariant matrix norms
- On the robustness to multiple agent losses in 2D and 3D formations
- Count and cofactor matroids of highly connected graphs
- Graph transformations for efficient structural analysis
- Graph rigidity properties of Ramanujan graphs
- On the generic rigidity of bar-frameworks
- Sharp threshold for rigidity of random graphs
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- Spectral radius conditions for the rigidity of graphs
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Sufficient conditions for 2-dimensional global rigidity
- Rigid two-dimensional frameworks with three collinear points
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
This page was built for publication: On Generic Rigidity in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960720)
