Graphs G for which G and \(\bar G\) are both semidecomposable (Q1820170)

A sequence \(\pi =(d_ 1,d_ 2,...,d_ n)\) of integers is graphical if there exists a graph on n vertices for which \(d_ 1,d_ 2,...,d_ n\) is the sequence of the degrees of its vertices. The set \(G(\pi)\) denotes the set of all graphs G on n vertices for which \(\pi\) is the sequence of the degrees of the vertices of G. Let P be a graphical property and \(G(P)\) the set of all graphs having property P. Then P is called forcible if \(G(P)\cap G(\pi)\neq \emptyset\) implies \(G(\pi) \subseteq G(P)\). A graphical sequence \(\pi\) is called forcibly P-graphical if \(G(\pi) \subseteq G(P)\). A graph is called chordal if it contains no induced subgraphs isomorphic to \(C_ n\) where \(n>3\). Suppose that C is a cycle and that u and v are nonconsecutive vertices of C. If uv is an edge, then uv is called a chord of C. If at least one of the two u-v paths determined by C has odd length, then the chord uv is called strong. A graph is called strongly chordal if it is chordal and if each even cycle of length at least 6 has a strong chord. The authors characterize forcibly chordal, forcibly strongly chordal, forcibly interval and forcibly trivially perfect graphical sequences.