On Mon, 3 Feb 2003, Jim Nastos wrote: > is equivalent to saying that a graph with n vertices and n edges is either > disconnected or a cycle, This should be a graph with n vertices and n edges *with no vertices of degree 1* is either disconnected or a cycle. Jim