Dataset of (3,6)-tight graphs
收藏NIAID Data Ecosystem2026-05-02 收录
数据链接：
官方服务：
资源简介：
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.
创建时间：
2024-09-16
相关数据集
暂无相关数据集
