Assertion: clique's vertex | /r/HasProperty | ordered into perfect elimination ordering
Facets:
Source sentences:
text: A chordal graph is a graph whose vertices can be ordered into a perfect elimination ordering, an ordering such that the neighbors of each vertex v that come later than v in the ordering form a clique.