Assertion: graph's vertex | /r/HasAspect | three nonempty subsets
Facets:
Source sentences:
text: The family of chordal graphs may be defined inductively as the graphs whose vertices can be divided into three nonempty subsets A, S, and B, such that A ∪ S and S ∪ B both form chordal induced subgraphs, S is a clique, and there are no edges from A to B.