genCRN: Fast enumeration of non-isomorphic chemical reaction networks
-
Updated
Oct 2, 2020 - C
#
nauty
Here are 17 public repositories matching this topic...
Counting chordless cycles in undirected graphs
-
Updated
Sep 27, 2017 - C++
Cubic graph enumeration project based on "Fast generation of cubic graphs" paper.
c graph information-visualization graph-theory gephi graph-visualization nauty k4 graph-enumeration roma-tre-university cubic-graph
-
Updated
Aug 7, 2023 - C
A proof-of-concept library for motif analysis using MDL techniques.
proof motif-counts network-analysis graph-analytics motif-discovery motive motif-analysis nauty motifs network-motifs
-
Updated
May 28, 2022 - Java
🍿 Enumeration of 2-level polytopes
linear-programming mathematics enumeration polytope combinatorial-optimization nauty communication-complexity
-
Updated
Aug 18, 2018 - C++
A plugin for the utility program geng provided with Nauty that enables quick generation of nonisomorphic sparse and tight graphs.
-
Updated
May 1, 2024 - C
C++ multithreaded wrapper for nauty's gen(tree)g
-
Updated
Oct 30, 2024 - C++
C++ Wrappers for Nauty & Traces Isomorphism C-code
-
Updated
Apr 2, 2024 - C
CCZ-equivalence determination of APN functions via graph isomorphism and I/R algorithms
cryptography finite-fields coding-theory nauty graph-isomorphism sbox apn-functions ccz-equivalence canonical-labeling
-
Updated
Apr 15, 2026
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.
python research cpp graph-algorithms computational-mathematics discrete-mathematics graph-theory combinatorics nauty reconstruction-conjecture
-
Updated
Jun 4, 2026 - Python
Docker image for nauty and Traces
-
Updated
Jan 16, 2022 - Dockerfile
Census data, audit reports, and code for: Chen & Shan, Exploring the world of edge-chromatic 3-critical graphs
reproducible-research graph-theory combinatorics census nauty edge-coloring snarks chromatic-index critical-graphs
-
Updated
Jun 24, 2026 - Python
Generating and counting connected integral graphs of order n=16, k=46 using nauty/geng with sequential, OpenMP, and CUDA spectral sieves.
-
Updated
Jun 11, 2026 - C
Improve this page
Add a description, image, and links to the nauty topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the nauty topic, visit your repo's landing page and select "manage topics."