nauty

The d-SEAMS C++ core engine

Counting chordless cycles in undirected graphs

genCRN: Fast enumeration of non-isomorphic chemical reaction networks

A proof-of-concept library for motif analysis using MDL techniques.

Cubic graph enumeration project based on "Fast generation of cubic graphs" paper.

🍿 Enumeration of 2-level polytopes

A plugin for the utility program geng provided with Nauty that enables quick generation of nonisomorphic sparse and tight graphs.

C++ multithreaded wrapper for nauty's gen(tree)g

Scala wrapper for Nauty

C++ Wrappers for Nauty & Traces Isomorphism C-code

Census data, audit reports, and code for: Chen & Shan, Exploring the world of edge-chromatic 3-critical graphs

Enumeration of 2-level polytopes

OCaml bindings to nauty

Perl bindings for Nauty

Research toolkit for computing the edge reconstruction number (ERN) and degree-associated edge reconstruction number (DERN) of split graphs. Exhaustively generates split graphs and computes ern(G) and dern(G) exactly via dual Python/C++ pipelines built on nauty. Accompanies an in-progress honors thesis.

Орбита — выявление клонов и ботов в локальных подграфах социальных сетей с использованием симметрий графов (nauty, Жаккар, эксперименты)

Java implementation of nauty.

C++20 library and tools for Riordan posets: posets whose order relation is a binary Riordan matrix. Enumerates Riordan poset matrices, counts Riordan posets up to isomorphism (verified to n = 28), recognizes Riordan posets, and decides when a Riordan poset is infinite. Includes tests, data and independent verification.

Erdős Problem #757 (Tao C_5b): no 16-point (4,5)-set with Sidon number 9, and the 14-point classification — computer-assisted

Generating and counting connected integral graphs of order n=16, k=46 using nauty/geng with sequential, OpenMP, and CUDA spectral sieves.