The LEDA Library - LEDA is a library of the data types and algorithms of combinatorial computing.
GraphThing - Tool for investigating Graph Theory, with a GTK interface. Free under GPL. Unix, source code in C.
Nauty - A program for computing automorphism groups of graphs and digraphs. It can also produce a canonical labelling.
Groups and Graphs - A software package for graphs, digraphs, combinatorial designs, and their automorphism groups.
Free Software on Graph theory - Free Software for Win 9X,NT on Graph Theory. Editor of the Graphs, Clipboard. Procedures: Metrics of the graph Paths and cycles Colorations Authomorphism group Minimal spanning tree Shortest paths Max. Capacity path K Shortest paths Salesman problem Maximal flow Critical path Reports for Graphs Print
Scalable Libraries for Graph Partitioning - We are pursuing research in the area of new parallel methods for graph partitioning and incremental graph partitioning. Efficient methods for graph partitioning and incremental graph partitioning are important for parallelization of a large number of unstructured and/or adaptive applications.
Discreta - A program to construct t-designs with prescribed automorphism group.
Gato: The Graph Animation Toolbox - Software for visualizing graph algorithms. Free under GPL. Unix, Linux, MacOs ad Windows versions.
plantri and fullgen - Programs for generation of certain types of planar graph, generated in such a way that exactly one member of each isomorphism class is output without the need for storing them.
GRAPE - A GAP share-package for computing with graphs; primarily designed for the efficient construction and analysis of graphs related to groups, combinatorial designs and finite geometries.
Algorithms and Software for Partitioning Meshes - Using combinatorics to solve structured linear systems of equations.
METIS: Family of Multilevel Partitioning Algorithms - Graph, mesh, and hypergraph partitioning software.
SF, Posets and Coxeter/Weyl - John Stembridge's Maple packages for symmetric functions, posets, root systems, and finite Coxeter groups.
Graph Partitioners - Three algorithms written in NESL for finding separators of graphs, in order to compare the quality of the cuts.
LINK: A Software System for Discrete Mathematics - A general-purpose, extendible computing environment in which discrete mathematical objects representing real world problems can be easily manipulated and visualized.
Cabri-graphs - Free Macintosh software for graph theory.
Matroid Software - It calculates circuits, cocircuits, bases, hyperplanes etc. for binary matroids. ANSI C. Downloadable.