Strangulated graphs are the graphs in which every peripheral cycle is a triangle. In a maximal planar graph (or more generally a polyhedral graph) the peripheral cycles are the faces, so maximal planar graphs are strangulated. The strangulated graphs include also the chordal graphs, and are exactly the graphs that can be formed by clique-sums (without deleting edges) of complete graphs and maximal planar graphs..
strangulated graphs are the graphs in which every peripheral cycle is a triangle in a maximal planar graph (or more generally a polyhedral graph) the peripheral cycles are the faces so maximal planar graphs are strangulated the strangulated graphs include also the chordal graphs and are exactly the graphs that can be formed by clique-sums (without deleting edges) of complete graphs and maximal planar graphs