Rigid tensegrity labelings of graphs
type: Item
instance of: scholarly article
title: Rigid tensegrity labelings of graphs
zbMATH Open document ID: 1226.05216
author: Tibor Jordán
author: András Recski
author: Zoltán Szabadka
published in: European Journal of Combinatorics
publication date: 2009-12-03T00:00:00Z
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 5641713
MaRDI profile type: Publication
full work available at URL: j.ejc.2008.12.014
OpenAlex ID: W1979177743
cites work: Q4274004
cites work: Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
cites work: Tensegrity Frameworks
cites work: Rigidity and energy
cites work: Q4717849
cites work: Q4279195
cites work: Connected rigidity matroids and unique realizations of graphs
cites work: A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
cites work: Dividing a Graph into Triconnected Components
cites work: Algorithms - ESA 2003
DOI: 10.1016/J.EJC.2008.12.014
Recommended article: Strongly rigid tensegrity graphs on the line
Recommended article: On the global rigidity of tensegrity graphs
Recommended article: Rigidity and reconstruction for graphs
Recommended article: \(\ell_ 1\)-rigid graphs
Recommended article: Q3060861
Recommended article: Rigid realizations of graphs on small grids
Recommended article: Q3218175
Recommended article: Q3723287
Recommended article: Q4544370
Recommended article: Rigidity, global rigidity, and graph decomposition
description: scientific article; zbMATH DE number 5641713