Assertion: chordal graph | /r/HasProperty | graph
Facets:
value: precisely
type: DEGREE
value: according to a theorem of dirac
type: OTHER
Source sentences:
text: According to a theorem of Dirac (1961), chordal graphs are graphs in which each minimal separator is a clique; Dirac used this characterization to prove that chordal graphs are perfect.
text: Strongly chordal graphs are graphs that are chordal and contain no n-sun (for n ≥ 3) as an induced subgraph.
text: Chordal graphs are precisely the graphs that are both odd-hole-free and even-hole-free (see holes in graph theory).