From: grossman@saturn.acs.oakland.edu (Jerry Grossman)
Newsgroups: sci.math
Subject: Re: all graphs such that ...
Date: 25 Feb 1995 17:44:41 GMT

In article <3ilm6e$m9r@newsreader.wustl.edu> jb1556@daditz.sbc.com writes:
>I wish to produce a list of all (up to isomorphism) graphs satisfying a short
>list of conditions.  An example:  all which satisfy 
>
>   (a) 13 vertices
>   (b) planar and connected 
>   (c) at least 24 edges
>   (d) each vertex has valance 3, 4, or 5
>
>Is there software available that can do this?  Where?
>--
>Jim Buddenhagen

YES!  Write to Brendan McKay, bdm@cs.anu.edu.au.  His makeg program does 
precisely this sort of thing, quite fast.

---------------------------------------
  Jerrold W. Grossman, Professor
  Department of Mathematical Sciences
  Oakland University
  Rochester, MI  48309-4401
  (810) 370-3443 [FAX (810) 370-4184]
  grossman@vela.acs.oakland.edu
---------------------------------------