is mentioned by

Thm* For any graph the_obj:GraphObject(the_graph). M:(Traversal). (i:V, s:Traversal. M([inl(i) / s])M(s)) & (i:V, s:Traversal. member-paren(x,y.the_obj.eq(x,y);i;s) M([inr(i) / s]) < M(s))	[dfs-measure]
Thm* For any graph the_obj:GraphObject(the_graph), P,Q:(V). (x:V. P(x) Q(x)) vertex-count(the_obj;x.P(x))vertex-count(the_obj;x.Q(x))	[vertex-count-le]

In prior sections: int 1 bool 1 int 2 list 1 mb nat mb list 1 num thy 1 graph 1 1 graph 1 2 core

Try larger context: Graphs