Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
up vote 4 down vote accepted

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.

share|cite|improve this answer
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

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.