[math-fun] chem Q?

Jim Hendrickson of the chemistry department here just asked me whether there was a good algorithm for finding the set of all one- or two-edge cut sets of a graph. When pressed, he said he'd actually like to find the cut which leaves two pieces as close to the same size as possible. Anyone know a good way to do this? I think anything better than brute force would count as "good". (The graphs he's interested in are ones that indicate bonded atoms in a molecule, so each vertex has degree at most four.) --Michael Kleber kleber@brandeis.edu