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.

, , , ,
doi.org/10.1016/j.disc.2017.05.002, hdl.handle.net/1765/100197
Discrete Mathematics
Department of Econometrics

Jamison, R., & Mulder, M. (2017). Graphs constructible from cycles and complete graphs. Discrete Mathematics, 340(9), 2301–2306. doi:10.1016/j.disc.2017.05.002