Let G be a simple graph. Prove that G is a nonrooted tree if and only if G is connected
Chapter 6, Problem 41(choose chapter or problem)
Let G be a simple graph. Prove that G is a nonrooted tree if and only if G is connected and if the removal of any single arc from G makes G unconnected.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer