Sufficient conditions for the global rigidity of graphs
Author:
- Shin-Ichi TanigawaSTShin-Ichi Tanigawa
- 1 July 2015
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 113, 123-140
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- JSPS (25240004)
- JSPS (24740058)
This publication has 24 references indexed in Scilit:
- Generic global rigidity of body–bar frameworksJournal of Combinatorial Theory, Series B, 2013
- Combining globally rigid frameworksProceedings of the Steklov Institute of Mathematics, 2011
- New Classes of Counterexamples to Hendrickson’s Global Rigidity ConjectureDiscrete & Computational Geometry, 2010
- Global Rigidity: The Effect of ConingDiscrete & Computational Geometry, 2009
- Generic Global RigidityDiscrete & Computational Geometry, 2004
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroidJournal of Combinatorial Theory, Series B, 2003
- Independence and port oracles for matroids, with an application to computational learning theoryCombinatorica, 1996
- Rigidity and energyInventiones Mathematicae, 1982
- When is a bipartite graph a rigid framework?Pacific Journal of Mathematics, 1980
- The rigidity of graphsTransactions of the American Mathematical Society, 1978