Graphs constructible from cycles and complete graphs

A graph G is Θ3-closed provided any two vertices of G that are joined by three internally disjoint paths are adjacent. We show that the Θ3-closed graphs are precisely those that can be obtained by gluing together cliques and cycles along vertices or edges.