Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!garfield!grant
From: grant@garfield.cs.mun.ca (Grant Burton)
Newsgroups: comp.theory
Subject: Graph enumeration algorithm, graph minors
Message-ID: <1991Feb4.162458.6244@garfield.cs.mun.ca>
Date: 4 Feb 91 16:24:58 GMT
Sender: grant@garfield.cs.mun.ca (Grant Burton)
Organization: CS Dept, Memorial University of Newfoundland
Lines: 38



  I am doing research on minimal forbidden minors for the class of
partial k-trees, fixed k. The obstruction sets for k = {1,2,3} are
known, however to find the obstruction set for any k >= 4 seems to
be a formidable task. I propose an open ended computer search for small
values of k; I know this is a very stupid thing to do, but I only intend
to use the computer search as a tool.

  I need computer code (prefer the C language) to generate all non isomorphic
graphs. I know that the non-isomorphic graphs can be enumerated, I am
too lazy to implement the algorithm myself. It would be nice to have
'tested' code made available to me.

  I doubt very much that anybody has implemented the minor testing algorithm
that answers 'Is fixed graph H a minor of arbitrary graph G?'. If anybody
has this implemented I would love to have the code for this algorithm as
well.

  Any code, response, sugestion, comment, or critique should be e-mailed
to me.

Mailing address:
  Grant Burton
  Department of Computer Science
  Memorial University of Newfoundland
  St. John's, Newfoundland, Canada

E-mail
  grant@garfield.cs.mun.ca

  Thank You,
  Grant Burton

-- 
|   grant@garfield.cs.mun.ca
|   Man said "let there be light", and there was fire. Man being lonely created
|   machine in the image of himself, and chaos was discovered.