Assertion: chordal graph | /r/HasProperty | orderable
Facets:
value: perfectly
type: DEGREE
Source sentences:
text: Chordal graphs are perfectly orderable: an optimal coloring may be obtained by applying a greedy coloring algorithm to the vertices in the reverse of a perfect elimination ordering.