# Which graphs, with at least one edge have the the property that every edge is a bridge?

Which graphs, with at least one edge have the the property that every edge is a bridge?

I know trees are one. Do you have more examples?

-

Unless I am missing something, a forest (collection of trees) are the only such graphs.

If there was a cycle, then the edges of the cycle would not be bridges.

-
Oh right, What about paths? I meant to say paths. Is a forest a path? –  Mark Jul 30 '11 at 22:31
@Mark: A path is a tree, which by definition, is a forest too. –  Aryabhata Jul 30 '11 at 22:36
@Mark "Is a forest a path?" Not sure what you meant, but a path is a particular example of a tree, and trees are special cases of forests with just $1$ component. –  Srivatsan Jul 31 '11 at 2:03