Constructing Uniquely Realizable Graphs
- 25 September 2013
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 50 (4) , 1051-1071
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Rigidity and polynomial invariants of convex polytopesDuke Mathematical Journal, 2005
- Metric matrix embedding in protein structure calculations, NMR spectra analysis, and relaxation theoryMagnetic Resonance in Chemistry, 2003
- Circular chromatic numberDiscrete Mathematics, 2001
- Approximate graph coloring by semidefinite programmingJournal of the ACM, 1998
- Initialization in semidefinite programming via a self-dual skew-symmetric embeddingOperations Research Letters, 1997
- Tensegrity frameworksTransactions of the American Mathematical Society, 1981
- Uniquely colorable graphsJournal of Combinatorial Theory, 1969
- On chromatic number of finite set-systemsActa Mathematica Hungarica, 1968
- New Foundation of Euclidean GeometryAmerican Journal of Mathematics, 1931