Dataset of minimally d-rigid graphs obtained from 0-extensions

The data set containes compressed files for mininimally d-rigid graphs that can be obtained from K_d with a sequence of 0-extensions (Henneberg Type 1) for dimensions d from 1 to 16 and a small number of vertices. Equivalently, these are maximal d-degenerate graphs. A graph is k-degenerate if it does not contain a subgraph with minimum degree k+1. Each file is in graph6 data format. The compressed folders are named in the pattern "MinimallyRigidZeroExtGraphsD<d>V<range>.zip" where <d> is the dimension and <range> describes the number of vertices.In each folder the files are named accordingly with "MinimallyRigidZeroExtGraphsD<d>V<n>.g6" where <n> is the number of vertices.