 Before Laman's and Geiringer's work, characterized the two-dimensional minimally rigid graphs (that is, the Laman graphs) in a different way.Henneberg showed that the minimally rigid graphs on two or more vertices are exactly the graphs that can be obtained, starting from a single edge, by a sequence of operations of the following two types