Dataset of minimally d-rigid graphs obtained from 0-extensions
Abstract
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 V .zip" where is the dimension and describes the number of vertices.In each folder the files are named accordingly with "MinimallyRigidZeroExtGraphsD V .g6" where is the number of vertices.
Fields of Study & Subjects
Advanced Graph Theory Research
Advanced Combinatorial Mathematics
Structural Analysis and Optimization
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 10 February 2026
- Language
- EN
- Document type
- Dataset