Assertion: graph | /r/HasAspect | ordering
Facets:
value: with coloring number
type: OTHER
value: κ
type: OTHER
value: in each subgraph h
type: LOCATION
Source sentences:
text: For, if a graph has an ordering with coloring number κ then in each subgraph H the vertex that belongs to H and is last in the ordering has at most κ − 1 neighbors in H.