Generating Graphs

What Type of Graphs?
All unlabelled graphs. Connected graphs. Bipartite graphs. Connected bipartite graphs. Triangle-free graphs. Connected triangle-free graphs. Bicoloured graphs. Connected bicoloured graphs.

Parameters:
n =	max degree =
m = (only for bicoloured graphs)
min edges =	max edges =

Output:
Standard Representation 1 (one-line) Standard Representation 2 (adj list) Standard Representation 2 (matrix)

Notes:

All we're doing here so far is to provide a nice interface for Brendan McKay's makeg program.
The values of n and m must lie between 1 and 16.
Selections can be mixed and matched under "What type of graph", with the understanding that selecting bipartite graphs but not triangle-free graphs will give you also all triangle-free graphs (since every bipartite graph is triangle free).
Eventually we would like to add the generation of other unlabelled objects: digaphs, posets, lattices.

Questions?? Email The wizard of COS.

(Please note that the suffix XXXX must be removed from the preceeding email address.)
It was last modified Wednesday, 10-May-2006 10:32:13 PDT.
There have been 5860 visitors to this page since May 16, 2000 .
©Frank Ruskey, 1995-2003.