bdm659@csc.anu.oz.au (10/22/90)
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.