Henneberg constructions and covers of cone-Laman graphs
classification
🧮 math.CO
keywords
coloredfamiliesgraphssparseconstructionscoversarisingcone-laman
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.