Sufficient Conditions for 2-Dimensional Global Rigidity

DOI10.1137/20M1375498zbMath1477.05096arXiv2106.08539OpenAlexW3206320983MaRDI QIDQ5163515

Gexin Yu, Martin Rolek, Xiaofeng Gu, Wei Meng, Yue Wang

Publication date: 4 November 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08539

zbMATH Keywords

global rigidityrigid graphredundant rigidityessential connectivity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40)

Related Items (1)

Spectral radius conditions for the rigidity of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Longest cycles in 3-connected planar graphs
• A sufficient connectivity condition for generic rigidity in the plane
• Connected rigidity matroids and unique realizations of graphs
• Generic global rigidity
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• On graphs and rigidity of plane skeletal structures
• The 2-dimensional rigidity of certain families of graphs
• On Generic Rigidity in the Plane
• Conditions for Unique Graph Realizations
• The Rigidity of Graphs

This page was built for publication: Sufficient Conditions for 2-Dimensional Global Rigidity