Minimally globally rigid graphs
From MaRDI portal
Publication:2107492
DOI10.1016/j.ejc.2022.103626zbMath1504.05197arXiv2202.11617OpenAlexW4306399863MaRDI QIDQ2107492
Dániel Garamvölgyi, Tibor Jordán
Publication date: 1 December 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.11617
Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global rigidity: The effect of coning
- A sufficient connectivity condition for generic rigidity in the plane
- Extremal critically connected matroids
- Connected rigidity matroids and unique realizations of graphs
- Generically globally rigid graphs have generic universally rigid frameworks
- On the 2-sum in rigidity matroids
- Sufficient conditions for the global rigidity of graphs
- Global rigidity of triangulations with braces
- Generic global rigidity
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- Globally linked pairs of vertices in equivalent realizations of graphs
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- Characterizing generic global rigidity
- On Generic Rigidity in the Plane
- Conditions for Unique Graph Realizations
- Sums of rank-one matrices and ranks of principal submatrices
- Globally rigid graphs are fully reconstructible
- On minimally highly vertex-redundantly rigid graphs
- Flexible circuits in the d‐dimensional rigidity matroid
This page was built for publication: Minimally globally rigid graphs
