The following pages link to (Q4012027):
Displaying 23 items.
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- Lower bounds for locally highly connected graphs (Q343698) (← links)
- Periodic rigidity on a variable torus using inductive constructions (Q490294) (← links)
- Finite and infinitesimal rigidity with polyhedral norms (Q894682) (← links)
- Lower-bound theorems for pseudomanifolds (Q1346138) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. (Q1405103) (← links)
- Connected rigidity matroids and unique realizations of graphs (Q1775892) (← links)
- How to describe or design a polyhedron (Q1842764) (← links)
- Skeletal rigidity of simplicial complexes. I (Q1896338) (← links)
- Skeletal rigidity of simplicial complexes. II (Q1898054) (← links)
- Graph rigidity via Euclidean distance matrices (Q1978125) (← links)
- The rigidity of infinite graphs (Q1991339) (← links)
- The rigidity of infinite graphs. II (Q2127718) (← links)
- On dimensional rigidity of bar-and-joint frameworks (Q2370423) (← links)
- On the dual rigidity matrix (Q2469523) (← links)
- Rigid realizations of graphs on small grids (Q2571214) (← links)
- Rigidity and polynomial invariants of convex polytopes (Q2572640) (← links)
- (Q4400942) (← links)
- Epsilon local rigidity and numerical algebraic geometry (Q5030251) (← links)
- Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach (Q5261877) (← links)
- On rigidity and realizability of weighted graphs (Q5932187) (← links)
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) (← links)
