We Solve Problems
Problems
Categories
F.A.Q.
Sign In
Sign Up
Sign Up
Problem
#PRU-30784
Empty Category
12–13
2.0
Problem
Prove that a graph, in which every two vertices are connected by exactly one simple path, is a tree.
To see the solution
register
and get verified.