Henneberg constructions and covers of cone-Laman graphs

Louis Theran – 2012

Focus Area 1: High-complexity Geometry
We give Henneberg-type constructions for three families of sparse colored graphs arising in the rigidity theory of periodic and other forced symmetric frameworks. The proof method, which works with Laman-sparse finite covers of colored graphs highlights the connection between these sparse colored families and the well-studied matroidal (k, l)-sparse families.