
theorem
  for P being non _trivial Path-like _Graph holds
    (P.order() = 2 iff P.maxDegree() = 1) &
    (P.order() <> 2 iff P.maxDegree() = 2) by Lm7;
