Reconfiguration of four-degree limited Laman graphs

Abstract

Abstract This paper proposes several simple algorithms for expanding and reducing Laman graphs, of which each vertex has at most four neighbors. These algorithms can be iteratively performed to construct or degenerate a given four-degree limited Laman graph. The correctness of the proposed algorithms is asserted by Laman’s criterion.