The non-solvability by radicals of generic 3-connected planar Laman graphs
From MaRDI portal
Publication:3420400
DOI10.1090/S0002-9947-06-04049-9zbMath1106.68115MaRDI QIDQ3420400
Publication date: 1 February 2007
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Computer science aspects of computer-aided design (68U07) Separable extensions, Galois theory (12F10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40)
Related Items (6)
Characterizing graphs with convex and connected Cayley configuration spaces ⋮ Radically solvable graphs ⋮ Trilateration using unlabeled path or loop lengths ⋮ Equivalent realisations of a rigid graph ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs ⋮ FRAMEWORKS SYMMETRY AND RIGIDITY
Cites Work
- The rigidity of graphs. II
- Planar minimally rigid graphs and pseudo-triangulations
- Geometric constraint solver
- On graphs and rigidity of plane skeletal structures
- Dividing a Graph into Triconnected Components
- Automated Deduction in Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The non-solvability by radicals of generic 3-connected planar Laman graphs