Assertion: graph | /r/HasAspect | perfect elimination ordering
Facets:
Source sentences:
text: A graph is chordal if and only if it has a perfect elimination ordering.
text: The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree.