Connected rigidity matroids and unique realizations of graphs
From MaRDI portal
Publication:1775892
A graph is shown to have a unique realization in the plane if and only if it is 3-connected and redundantly rigid, resolving the last open case of a conjecture by \textit{B. Hendrickson} [SIAM J. Comput. 21, 65--84 (1992; Zbl 0756.05047)]. One key ingredient for the proof is the fact that 2-rigidity leads to a finer decomposition of the rigidity matroid than the one pointed out by \textit{B. Servatius} [SIAM J. Discrete Math. 2, 582--589 (1989; Zbl 0723.05034)], another is the new characterization of M-circuits by \textit{A. Berg} and \textit{T. Jordán} [J. Comb. Theory, Ser. B 88, 77--97 (2003; Zbl 1036.05047)].
Recommendations
Cites work
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Algorithms for graph rigidity and scene analysis
- Birigidity in the Plane
- Conditions for Unique Graph Realizations
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3917126 (Why is no real title available?)
- scientific article; zbMATH DE number 17636 (Why is no real title available?)
- scientific article; zbMATH DE number 67319 (Why is no real title available?)
- scientific article; zbMATH DE number 3493472 (Why is no real title available?)
- scientific article; zbMATH DE number 501471 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Independence and port oracles for matroids, with an application to computational learning theory
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- Rigidity and energy
- The Molecule Problem: Exploiting Structure in Global Optimization
Cited in
(only showing first 100 items - show all)- A sufficient connectivity condition for generic rigidity in the plane
- Rigid tensegrity labelings of graphs
- On characterizations of rigid graphs in the plane using spanning trees
- Cuts, matrix completions and graph rigidity
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Configurations of lines in space and combinatorial rigidity
- Equivalent realisations of a rigid graph
- Minimal NMR distance information for rigidity of protein graphs
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- The rigidity of infinite graphs
- Graph reconstruction from unlabeled edge lengths
- Minimum size highly redundantly rigid graphs in the plane
- Spectral conditions for graph rigidity in the Euclidean plane
- Sufficient conditions for the global rigidity of periodic graphs
- Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
- Minimally globally rigid graphs
- Globally rigid powers of graphs
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Phase retrieval of complex and vector-valued functions
- An application-based characterization of dynamical distance geometry problems
- Generically globally rigid graphs have generic universally rigid frameworks
- \(\ell^1\) and \(\ell^\infty\) plane
- Global rigidity of direction-length frameworks
- Global rigidity of periodic graphs under fixed-lattice representations
- Global rigidity of generic frameworks on the cylinder
- Sufficient conditions for the global rigidity of graphs
- Iterative universal rigidity
- Free edge lengths in plane graphs
- Characterizing graphs with convex and connected Cayley configuration spaces
- Radically solvable graphs
- Global rigidity of triangulations with braces
- Rigid two-dimensional frameworks with three collinear points
- The d-dimensional rigidity matroid of sparse graphs
- Rigid realizations of graphs on small grids
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Gain-sparsity and symmetry-forced rigidity in the plane
- Global rigidity of (quasi-)injective frameworks on the line
- The unassigned distance geometry problem
- Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Euclidean distance matrices and applications
- Development of redundant rigidity theory for formation control
- Addressing agent loss in vehicle formations and sensor networks
- UAV formation control: theory and application
- Operations preserving global rigidity of generic direction-length frameworks
- Who needs crossings? Hardness of plane graph rigidity
- Unique low rank completability of partially filled matrices
- Minimum cost globally rigid subgraphs
- On the robustness to multiple agent losses in 2D and 3D formations
- On persistent directed graphs
- Constructing uniquely realizable graphs
- Conditions for Unique Graph Realizations
- Packing of rigid spanning subgraphs and spanning trees
- A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid
- Generically globally rigid zeolites in the plane
- Boundedness, rigidity and global rigidity of direction-length frameworks
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Periodic rigidity on a variable torus using inductive constructions
- Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Globally rigid augmentation of rigid graphs
- Self-dual polyhedra of given degree sequence
- Globally rigid graphs are fully reconstructible
- Sufficient conditions for 2-dimensional global rigidity
- Global Rigidity of Unit Ball Graphs
- Generic unlabeled global rigidity
- Globally linked pairs of vertices in rigid frameworks
- One brick at a time: a survey of inductive constructions in rigidity theory
- 1-extensions and global rigidity of generic direction-length frameworks
- On Abstract Rigidity Matroids
- Bounded direction-length frameworks
- Necessary conditions for the global rigidity of direction-length frameworks
- Formation shape control based on bearing rigidity
- Distributed localization of wireless sensor network using communication wheel
- Spectral radius conditions for the rigidity of graphs
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
- Coincident-point rigidity in normed planes
- Exploring the rigidity of planar configurations of points and rods
- Graph rigidity properties of Ramanujan graphs
- Ear‐decompositions, minimally connected matroids and rigid graphs
- Count and cofactor matroids of highly connected graphs
- Four-regular graphs with extremal rigidity properties
- Global Rigidity of Line Constrained Frameworks
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- New classes of counterexamples to Hendrickson's global rigidity conjecture
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Partial reflections and globally linked pairs in rigid graphs
- Global rigidity of triangulated manifolds
- Rigid frameworks with dilation constraints
- Highly connected rigidity matroids have unique underlying graphs
- Generic global rigidity in _p-space and the identifiability of the p-Cayley-Menger varieties
- On the uniqueness of collections of pennies and marbles
- Minimal counterexamples to Hendrickson's conjecture on globally rigid graphs
- Stability of sequential lateration and of stress minimization in the presence of noise
- Globally linked pairs and cheapest globally rigid supergraphs
This page was built for publication: Connected rigidity matroids and unique realizations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775892)
