Dataset of (3,6)-tight graphs
From MaRDI portal
DOI10.5281/zenodo.13768206Zenodo13768206MaRDI QIDQ6697177
Dataset published at Zenodo repository.
Author name not available (Why is that?)
Publication date: 16 September 2024
Copyright license: No records found.
A graph G=(V,E) is (3,-6)-tight if |E|=3|V|-6 and for every subgraph G'=(V',E') with at least 3 vertices |E'|=3|V'|-6. The dataset provides all (3,6)-tight graphs with 3-11 vertices in graph6 data format as one zip file.
This page was built for dataset: Dataset of (3,6)-tight graphs
