for G being _Graph
for P being Path of G
for n, m being odd Element of NAT st n < m & m <= len P & ( n <> 1 or m <> len P ) holds
P .cut (n,m) is open