Henneberg constructions of some sparse colored graphs

Details Henneberg constructions of some sparse colored graphs Henneberg constructions of some sparse colored graphs

2012-04-02

arxiv.org/abs/1204.0503v1

Mathematics

Combinatorics

9 pages, 2 figures

Scientific paper

We give Henneberg-type constructions for some families of sparse colored
graphs arising in rigidity theory periodic and 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 Laman graphs.

Affiliated with

Also associated with

No associations

Rating

Henneberg constructions of some sparse colored graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Henneberg constructions of some sparse colored graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Henneberg constructions of some sparse colored graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510564