Editing Chordal graph (section)

===Superclasses===
Chordal graphs are a subclass of the well known [[perfect graph]]s. 
Other superclasses of chordal graphs include weakly chordal graphs, [[cop-win graph]]s, odd-hole-free graphs, [[even-hole-free graph]]s, and [[Meyniel graph]]s. Chordal graphs are precisely the graphs that are both odd-hole-free and even-hole-free (see [[hole (graph theory)|holes]] in graph theory).

Every chordal graph is a [[strangulated graph]], a graph in which every [[peripheral cycle]] is a triangle, because peripheral cycles are a special case of induced cycles. Strangulated graphs are graphs that can be formed by [[clique-sum]]s of chordal graphs and maximal planar graphs. Therefore, strangulated graphs include [[maximal planar graph]]s.{{sfnp|Seymour|Weaver|1984}}