Connected rigidity matroids and unique realizations of graphs
From MaRDI portal
Publication:1775892
DOI10.1016/J.JCTB.2004.11.002zbMATH Open1076.05021OpenAlexW2148291654MaRDI QIDQ1775892FDOQ1775892
Authors: Bill Jackson, Tibor Jordán 
Publication date: 4 May 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.002
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On graphs and rigidity of plane skeletal structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditions for Unique Graph Realizations
- Title not available (Why is that?)
- The Molecule Problem: Exploiting Structure in Global Optimization
- Title not available (Why is that?)
- Algorithms for graph rigidity and scene analysis
- On Generic Rigidity in the Plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rigidity and energy
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Birigidity in the Plane
- Independence and port oracles for matroids, with an application to computational learning theory
Cited In (only showing first 100 items - show all)
- Constructing uniquely realizable graphs
- Operations preserving the global rigidity of graphs and frameworks in the plane
- Packing of rigid spanning subgraphs and spanning trees
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- On Abstract Rigidity Matroids
- Gain-sparsity and symmetry-forced rigidity in the plane
- The unassigned distance geometry problem
- Rigid realizations of graphs on small grids
- 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
- Highly connected rigidity matroids have unique underlying graphs
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Bounded direction-length frameworks
- Necessary conditions for the global rigidity of direction-length frameworks
- A sufficient connectivity condition for generic rigidity in the plane
- Geometry of configuration spaces of tensegrities
- Rigid tensegrity labelings of graphs
- Rigid two-dimensional frameworks with three collinear points
- Globally rigid circuits of the direction-length rigidity matroid
- The rigidity of infinite graphs
- Equivalent realisations of a rigid graph
- Minimal NMR distance information for rigidity of protein graphs
- Cuts, matrix completions and graph rigidity
- Formation shape control based on bearing rigidity
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Iterative universal rigidity
- Characterizing graphs with convex and connected Cayley configuration spaces
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- Operations preserving global rigidity of generic direction-length frameworks
- Stress matrices and global rigidity of frameworks on surfaces
- Finite and infinitesimal rigidity with polyhedral norms
- Phase retrieval of complex and vector-valued functions
- Realizability of graphs in three dimensions
- Development of redundant rigidity theory for formation control
- Source location with rigidity and tree packing requirements
- Efficient algorithms for network localization using cores of underlying graphs
- Self-dual polyhedra of given degree sequence
- Unique low rank completability of partially filled matrices
- UAV formation control: theory and application
- Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
- The \(d\)-dimensional rigidity matroid of sparse graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Globally Rigid Augmentation of Rigid Graphs
- Generic global rigidity of body-hinge frameworks
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- One brick at a time: a survey of inductive constructions in rigidity theory
- Global rigidity: The effect of coning
- New classes of counterexamples to Hendrickson's global rigidity conjecture
- Geometric analysis characterizes molecular rigidity in generic and non-generic protein configurations
- Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
- Minimally globally rigid graphs
- On characterizations of rigid graphs in the plane using spanning trees
- Globally linked pairs of vertices in rigid frameworks
- Periodic rigidity on a variable torus using inductive constructions
- Configurations of lines in space and combinatorial rigidity
- Euclidean distance matrices and applications
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Sufficient conditions for the global rigidity of graphs
- Rigidity, global rigidity, and graph decomposition
- Spectral conditions for graph rigidity in the Euclidean plane
- Theory of semidefinite programming for sensor network localization
- Graph rigidity properties of Ramanujan graphs
- 1-extensions and global rigidity of generic direction-length frameworks
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Ear‐decompositions, minimally connected matroids and rigid graphs
- Minimum cost globally rigid subgraphs
- Partial reflections and globally linked pairs in rigid graphs
- Global rigidity of generic frameworks on the cylinder
- Globally rigid powers of graphs
- Spectral radius conditions for the rigidity of graphs
- Free edge lengths in plane graphs
- Globally rigid graphs are fully reconstructible
- Who needs crossings? Hardness of plane graph rigidity
- Generic unlabeled global rigidity
- Graph reconstruction from unlabeled edge lengths
- Sufficient conditions for 2-dimensional global rigidity
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
- Minimum size highly redundantly rigid graphs in the plane
- Generically globally rigid graphs have generic universally rigid frameworks
- Count and cofactor matroids of highly connected graphs
- Four-regular graphs with extremal rigidity properties
- Coincident-point rigidity in normed planes
- Global rigidity of triangulated manifolds
- Distributed localization of wireless sensor network using communication wheel
- Global rigidity of (quasi-)injective frameworks on the line
- Global Rigidity of Line Constrained Frameworks
- On persistent directed graphs
- Rigid frameworks with dilation constraints
- Global rigidity of direction-length frameworks
- An application-based characterization of dynamical distance geometry problems
- Addressing agent loss in vehicle formations and sensor networks
- Sufficient conditions for the global rigidity of periodic graphs
- Global rigidity of periodic graphs under fixed-lattice representations
- On the robustness to multiple agent losses in 2D and 3D formations
- \(\ell^1\) and \(\ell^\infty\) plane
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
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)
