i:Vertices(the_graph). (inl(i) 
s) 
L-the_graph- > *i) & ((i:Vertices(the_graph). L-the_graph- > *i 
non-trivial-loop(the_graph;i)) (L1,L2:Vertices(the_graph) List. L = (L1 @ L2) (
s1,s2:traversal(the_graph). s = (s2 @ s1) traversal(the_graph) & paren(Vertices(the_graph);s1) & paren(Vertices(the_graph);s2) & (j:Vertices(the_graph). ((inl(j) s1) 
L1-the_graph- > *j) & ((inl(j) s2) L2-the_graph- > *j & L1-the_graph- > *j)))))
is mentioned
In prior sections: graph 1 2 graph 1 3