theorem :: GLPACY00:30

for G being _finite non _trivial _Graph st G is acyclic & G .minDegree() = 1 & card (Endvertices G) = 2 holds
G is Path-like