An Inductive Construction of (2,1)-tight Graphs

zbMath1317.52027arXiv1103.2967MaRDI QIDQ5499963

Anthony Nixon, J. C. Owen

Publication date: 5 August 2015

Full work available at URL: https://arxiv.org/abs/1103.2967

zbMATH Keywords

inductive construction\((kframework on a surfacerigid graphHenneberg sequence\ell)\)-tight graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Related Items (8)

The rigidity of infinite graphs. II ⋮ Symmetry-forced rigidity of frameworks on surfaces ⋮ Contact Graphs of Circular Arcs ⋮ A constructive characterisation of circuits in the simple \((2,2)\)-sparsity matroid ⋮ Infinitesimal Rigidity in Normed Planes ⋮ Rigidity of symmetric frameworks in normed spaces ⋮ Motions of grid-like reflection frameworks ⋮ One Brick at a Time: A Survey of Inductive Constructions in Rigidity Theory

This page was built for publication: An Inductive Construction of (2,1)-tight Graphs