scientific article; zbMATH DE number 501471
From MaRDI portal
Publication:4279195
zbMath0788.05001MaRDI QIDQ4279195
Jack E. Graver, Brigitte Servatius, Herman J. Servatius
Publication date: 1 February 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Related Items
On Flattenability of Graphs ⋮ Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems ⋮ Stable Camera Motion Estimation Using Convex Programming ⋮ The Number of Realizations of a Laman Graph ⋮ Spanning Rigid Subgraph Packing and Sparse Subgraph Covering ⋮ Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres ⋮ Spectral radius conditions for the rigidity of graphs ⋮ Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane ⋮ Flexible circuits in the d‐dimensional rigidity matroid ⋮ Vertex spanning planar Laman graphs in triangulated surfaces ⋮ Sharp threshold for rigidity of random graphs ⋮ Nonlinear algebra and applications ⋮ Global Stabilization of Triangulated Formations ⋮ Computing Circuit Polynomials in the Algebraic Rigidity Matroid ⋮ Infinitesimal Rigidity in Normed Planes ⋮ What is a hinge mechanism? What did Kempe prove? ⋮ Maximal matroids in weak order posets ⋮ Lower Bounds on the Number of Realizations of Rigid Graphs ⋮ Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs ⋮ Cryptomorphisms for Abstract Rigidity Matroids ⋮ The rigidity of a partially triangulated torus ⋮ Unnamed Item ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ Controlling and Stabilizing a Rigid Formation Using a Few Agents ⋮ Walks: A Beginner's Guide to Graphs and Matrices ⋮ Higher order flexibility of octahedra ⋮ Decomposition plans for geometric constraint systems. I: Performance measures for CAD ⋮ Geometry of graph varieties ⋮ Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method ⋮ On minimally highly vertex-redundantly rigid graphs ⋮ Preface ⋮ Boundary Value Problem on a Weighted Graph Relevant to the Static Analysis of Truss Structures ⋮ Crystal Frameworks, Matrix-valued Functions and Rigidity Operators ⋮ Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach ⋮ Globally Linked Pairs of Vertices in Rigid Frameworks ⋮ Rigidity percolation and boundary conditions. ⋮ The rigidity of infinite graphs. II ⋮ Flexibility and movability in Cayley graphs ⋮ Symmetry-forced rigidity of frameworks on surfaces ⋮ On dimensional rigidity of bar-and-joint frameworks ⋮ Constructibility classes for triangle location problems ⋮ Enumerating non-crossing minimally rigid frameworks ⋮ Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Characterizing graphs with convex and connected Cayley configuration spaces ⋮ The generic rigidity of triangulated spheres with blocks and holes ⋮ Combinatorial pseudo-triangulations ⋮ Source location with rigidity and tree packing requirements ⋮ Connecting colored point sets ⋮ Theory of semidefinite programming for sensor network localization ⋮ A minmax relationship between embeddable and rigid graphs ⋮ Symmetric versions of Laman's theorem ⋮ Equivalence of continuous, local and infinitesimal rigidity in normed spaces ⋮ Pointed spherical tilings and hyperbolic virtual polytopes ⋮ Maxwell-independence: a new rank estimate for the 3-dimensional generic rigidity matroid ⋮ \(\ell^1\) and \(\ell^\infty\) plane ⋮ The hard Lefschetz property for Hamiltonian GKM manifolds ⋮ A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid ⋮ Computing the number of realizations of a Laman graph ⋮ Finite and infinitesimal rigidity with polyhedral norms ⋮ Generically globally rigid zeolites in the plane ⋮ Finite point configurations in the plane, rigidity and Erdős problems ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ On stress matrices of \((d + 1)\)-lateration frameworks in general position ⋮ A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. ⋮ Graph varieties in high dimension ⋮ On the edge crossing properties of Euclidean minimum weight Laman graphs ⋮ Highly connected molecular graphs are rigid in three dimensions ⋮ Graph rigidity for unitarily invariant matrix norms ⋮ Balanced generic circuits without long paths ⋮ Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits ⋮ Body-and-cad geometric constraint systems ⋮ The orbit rigidity matrix of a symmetric framework ⋮ Operations preserving the global rigidity of graphs and frameworks in the plane ⋮ On the number of realizations of certain Henneberg graphs arising in protein conformation ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Generic rigidity of molecular graphs via ear decomposition ⋮ Periodic rigidity on a variable torus using inductive constructions ⋮ Discretization vertex orders in distance geometry ⋮ Enumerating constrained non-crossing minimally rigid frameworks ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs ⋮ Cellular morphogenesis of three-dimensional tensegrity structures ⋮ Foreword to special issue ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ On the dual rigidity matrix ⋮ Some properties of linkage mappings ⋮ The rigidity of infinite graphs ⋮ Lower bound theorem for normal pseudomanifolds ⋮ On spaces of infinitesimal motions and three dimensional Henneberg extensions ⋮ Preface: Special issue dedicated to distance geometry ⋮ Efficient algorithms for the \(d\)-dimensional rigidity matroid of sparse graphs ⋮ Algebraic spectral synthesis and crystal rigidity ⋮ A proof of the molecular conjecture ⋮ Globally rigid circuits of the direction-length rigidity matroid ⋮ When is a symmetric pin-jointed framework isostatic? ⋮ On the topology of graph picture spaces ⋮ Combinatorial characterization of the Assur graphs from engineering ⋮ Geometric properties of Assur graphs ⋮ Rigidity, global rigidity, and graph decomposition ⋮ The Dress conjectures on rank in the 3-dimensional rigidity matroid ⋮ The slopes determined by \(n\) points in the plane ⋮ Rigid two-dimensional frameworks with three collinear points ⋮ Optimized parametrization of systems of incidences between rigid bodies ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Connected rigidity matroids and unique realizations of graphs ⋮ Enumerating pseudo-triangulations in the plane ⋮ Interrogating witnesses for geometric constraint solving ⋮ Triangulated Laman graphs, local stochastic matrices, and limits of their products ⋮ Coning, symmetry and spherical frameworks ⋮ Polyspherical coordinate systems on orbit spaces with applications to biomolecular shape ⋮ On the 2-sum in rigidity matroids ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ Transforming a graph into a 1-balanced graph ⋮ Spectral conditions for graph rigidity in the Euclidean plane ⋮ Efficient algorithms for network localization using cores of underlying graphs ⋮ The first-order flexibility of a crystallographic framework ⋮ Henneberg moves on mechanisms ⋮ On the generic rigidity of bar-frameworks ⋮ Switching formation shape control with distance + area/angle feedback ⋮ Multitriangulations as complexes of star polygons ⋮ Structural topology, or the fine art of rediscovery ⋮ A sufficient connectivity condition for generic rigidity in the plane ⋮ Graphs with flexible labelings ⋮ Rigid tensegrity labelings of graphs ⋮ A spatial unit-bar-framework which is rigid and triangle-free ⋮ Infinitesimal rigidity and prestress stability for frameworks in normed spaces ⋮ The \(d\)-dimensional rigidity matroid of sparse graphs ⋮ On the rigidity of molecular graphs ⋮ Existence and uniqueness of infinite components in generic rigidity percolation ⋮ On rigidity of unit-bar frameworks ⋮ Rigid realizations of graphs on small grids ⋮ Rigidity and polynomial invariants of convex polytopes ⋮ Flexible placements of graphs with rotational symmetry ⋮ Rigid two-dimensional frameworks with two coincident points