is mentioned by

Def adjl-graph(G) == < vertices = G.size, edges = x:G.size||G.out(x)||, incidence = e. < 1of(e),(G.out(1of(e)))[2of(e)] > >	[adjl-graph]
Def t.size == 1of(t)	[adjl_size]
Def adjm-graph(A) == < vertices = A.size, edges = {p:(A.sizeA.size)| (A.adj(1of(p),2of(p))) }, incidence = e.e >	[adjm-graph]
Def t.size == 1of(t)	[adjm_size]
Def t.graph == 1of(2of(t))	[grr_graph]
Def t.type == 1of(t)	[grr_type]
Def t.vaccw == 1of(2of(2of(2of(2of(2of(t))))))	[gro_vaccw]
Def t.vacc == 1of(2of(2of(2of(2of(t)))))	[gro_vacc]
Def t.eaccw == 1of(2of(2of(2of(t))))	[gro_eaccw]
Def t.eacc == 1of(2of(2of(t)))	[gro_eacc]
Def t.eqw == 1of(2of(t))	[gro_eqw]
Def t.eq == 1of(t)	[gro_eq]

In prior sections: core mb list 1 prog 1 graph 1 1 graph 1 2

Try larger context: Graphs