Several simple algorithms are proposed for expanding and reducing a Laman graph, of which each vertex has at most four neighbors. These algorithms can be iteratively applied to construct, reconfigure, or destroy a given four-degree limited Laman graph. The validity of the proposed algorithms is asserted by Laman’s criterion.
MSC Classification: 68R10