Enumerate all six-node graphs up to isomorphism

Enumerate all six-node graphs up to isomorphism

Generate every connected undirected graph on six vertices, group the graphs by edge count from 5 to 15, and reduce each group to isomorphism classes. Write one row per class. Deliverable: A generator and a CSV with edge_count, class_id, canonical_form, and degree_sequence.