i:Vertices(the_graph), s1,s2:traversal(the_graph). (j:Vertices(the_graph). i-the_graph- > *j 
non-trivial-loop(the_graph;j)) s = (s1 @ [inl(i)] @ s2) 
traversal(the_graph) (j:Vertices(the_graph). j = i i-the_graph- > *j (inl(j) s2))
is mentioned by
| Thm* For any graph
the_obj:GraphObject(the_graph). paren(V;depthfirst(the_obj)) & no_repeats(V+V;depthfirst(the_obj)) & df-traversal(the_graph;depthfirst(the_obj)) & depthfirst-traversal(the_graph;depthfirst(the_obj)) & (i:V. (inr(i) depthfirst(the_obj)) & (inl(i) depthfirst(the_obj))) | [depthfirst-properties] |
In prior sections: graph 1 2
Try larger context:
Graphs