scientific article; zbMATH DE number 3868113
From MaRDI portal
Publication:3334528
Recommendations
Cited in
(47)- Invariant computations for analytic projective geometry
- One-story buildings as tensegrity frameworks. III
- A homological interpretation of skeletal ridigity
- On the generic rigidity of bar-frameworks
- Skeletal rigidity of simplicial complexes. I
- The rigidity of the graphs of homology spheres minus one edge
- A note on generic rigidity of graphs in higher dimension
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Graph reconstruction from unlabeled edge lengths
- Extremal families of redundantly rigid graphs in three dimensions
- Minimally globally rigid graphs
- An asymptotic upper bound for graph embeddings
- Which graphs are rigid in \(\ell_p^d\)?
- New upper bounds for the number of embeddings of minimally rigid graphs
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- Double-distance frameworks and mixed sparsity graphs
- Global rigidity of generic frameworks on the cylinder
- A characterization of homology manifolds with \(g_{2}\geq 2\)
- Directed graphs, decompositions, and spatial linkages
- A geometric lower bound theorem
- Bipartite rigidity
- Unique low rank completability of partially filled matrices
- Bipartite rigidity
- Rigidity of frameworks on expanding spheres
- Globally rigid augmentation of rigid graphs
- Frameworks with Coordinated Edge Motions
- Globally rigid graphs are fully reconstructible
- Algebraic matroids in action
- Rigidity and the lower bound theorem. I
- Rigidity of multi-story buildings
- On minimally highly vertex-redundantly rigid graphs
- Flexible circuits in the d‐dimensional rigidity matroid
- A characterization of simplicial polytopes with \(g_{2}=1\)
- The orbit rigidity matrix of a symmetric framework
- Partial reflections and globally linked pairs in rigid graphs
- Computing maximum likelihood thresholds using graph rigidity
- Maximum likelihood thresholds via graph rigidity
- When is a planar rod configuration infinitesimally rigid?
- The number of realisations of a rigid graph in Euclidean and spherical geometries
- Rigidity and reconstruction in matroids of highly connected graphs
- On a construction of some homology d-manifolds
- Minimal counterexamples to Hendrickson's conjecture on globally rigid graphs
- Rigidity of balanced minimal cycle complexes
- Coning, symmetry and spherical frameworks
- Stable cuts, NAC-colourings and flexible realisations of graphs
- Sparsity, stress-independence and globally linked pairs in graph rigidity theory
- Global rigidity: The effect of coning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334528)
