Xref: utzoo sci.math:12915 comp.theory:1160
Path: utzoo!attcan!uunet!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!usc!apple!uokmax!munnari.oz.au!csc.anu.oz.au!bdm659
From: bdm659@csc.anu.oz.au
Newsgroups: sci.math,comp.theory
Subject: need 3-connectivity program
Message-ID: <1990Oct22.164218.3160@csc.anu.oz.au>
Date: 22 Oct 90 06:42:18 GMT
Organization: Computer Services, Australian National University
Lines: 6

If you have a working procedure for 3-connectivity of an undirected graph,
and are willing to share it, please contact me at  bdm@anucsd.anu.oz.au.
We are familiar with the standard algorithms for this problem, but would
like to avoid the time needed to implement them ourselves.  Many thanks.

Brendan McKay.   Computer Science, Australian National University.