On graphs and rigidity of plane skeletal structures
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Transforming a graph into a 1-balanced graph
- A sufficient connectivity condition for generic rigidity in the plane
- Mixed volume techniques for embeddings of Laman graphs
- Sparse hypergraphs and pebble game algorithms
- Sparsity-certifying graph decompositions
- On characterizations of rigid graphs in the plane using spanning trees
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- A correspondence between scene analysis and motions of frameworks
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- Hyperconnectivity of graphs
- A matroid on hypergraphs, with applications in scene analysis and geometry
- The rigidity of graphs. II
- On the two-dimensional generic rigidity matroid and its dual
- Forests, frames, and games: Algorithms for matroid sums and applications
- Existence and uniqueness of infinite components in generic rigidity percolation
- A new proof of Laman's theorem
- Isostatic bar and joint frameworks in the plane with irreducible pure conditions
- Metric graphs elastically embeddable in the plane
- Cuts, matrix completions and graph rigidity
- An algorithm for two-dimensional rigidity percolation: The pebble game
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Constructive characterizations for packing and covering with trees
- Group theory of icosahedral virus capsid vibrations: a top-down approach
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
- Algorithms for detecting dependencies and rigid subsystems for CAD
- Lefschetz properties of balanced 3-polytopes
- Angle measures, general rotations, and roulettes in normed planes
- Configurations of lines in space and combinatorial rigidity
- Computing the number of realizations of a Laman graph
- 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
- Rigid cylindrical frameworks with two coincident points
- Graphs without proper subgraphs of minimum degree 3 and short cycles
- Graph transformations for efficient structural analysis
- Motions of grid-like reflection frameworks
- Planar minimally rigid graphs and pseudo-triangulations
- Connected rigidity matroids and unique realizations of graphs
- On the generic rigidity of bar-frameworks
- Almost flat line configurations
- On the determinacy of repetitive structures.
- How to describe or design a polyhedron
- Zero temperature limit for interacting Brownian particles. I: Motion of a single body.
- Bending of surfaces. II
- Graph varieties in high dimension
- On numbers of pseudo-triangulations
- When is a symmetric body-bar structure isostatic?
- Generic rigidity of molecular graphs via ear decomposition
- Graph rigidity via Euclidean distance matrices
- Cellular morphogenesis of three-dimensional tensegrity structures
- The rigidity of infinite graphs
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Spectral conditions for graph rigidity in the Euclidean plane
- Sufficient conditions for the global rigidity of periodic graphs
- Homothetic packings of centrally symmetric convex bodies
- Flexing infinite frameworks with applications to braced Penrose tilings
- Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Sufficient connectivity conditions for rigidity of symmetric frameworks
- An asymptotic upper bound for graph embeddings
- Sparse graphs and an augmentation problem
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- The rigidity of infinite graphs. II
- Flexibility and movability in Cayley graphs
- Which graphs are rigid in \(\ell_p^d\)?
- Counting isolated points outside the image of a polynomial map
- Triangular angle rigidity for distributed localization in 2D
- Coincident rigidity of 2-dimensional frameworks
- New upper bounds for the number of embeddings of minimally rigid graphs
- Graphs with flexible labelings allowing injective realizations
- An application-based characterization of dynamical distance geometry problems
- Counting realizations of Laman graphs on the sphere
- On the maximal number of real embeddings of minimally rigid graphs in \(\mathbb{R}^2,\mathbb{R}^3\) and \(S^2\)
- Global rigidity of direction-length frameworks
- A quest for 2D lattice materials for actuation
- The isostatic conjecture
- Graph rigidity for unitarily invariant matrix norms
- Global rigidity of periodic graphs under fixed-lattice representations
- Rigidity of symmetric frameworks in normed spaces
- On spaces of infinitesimal motions and three dimensional Henneberg extensions
- Graded sparse graphs and body-length-direction frameworks
- On combinatorial structures of line drawings of polyhedra
- On Graver's conjecture concerning the rigidity problem of graphs
- Double-distance frameworks and mixed sparsity graphs
- Generation of planar tensegrity structures through cellular multiplication
- Graphs with flexible labelings
- Global rigidity of generic frameworks on the cylinder
- Rigid two-dimensional frameworks with two coincident points
- Sufficient conditions for the global rigidity of graphs
- Maxwell-Laman counts for bar-joint frameworks in normed spaces
- The reachability problem in constructive geometric constraint solving based dynamic geometry
- On dimensional rigidity of bar-and-joint frameworks
- Enumerating non-crossing minimally rigid frameworks
- Characterizing graphs with convex and connected Cayley configuration spaces
- A general graphical procedure for finding motion centers of planar mechanisms
- Completion of tree metrics and rank 2 matrices
- Radically solvable graphs
- Finite motions from periodic frameworks with added symmetry
- Matching edges and faces in polygonal partitions
- Matroid matching with Dilworth truncation
This page was built for publication: On graphs and rigidity of plane skeletal structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545109)
