Graph sandwich problems

The graph sandwich problem asks, for a pair of graphs G 1 = ( V , E 1 ) and G 2 = ( V , E 2 ) with E 1 E 2 , whether there exists a graph G = ( V , E ) that satisfies property and E 1 E E 2 . We consider the property of being F -free, where F is a fixed ...

The stubborn partition is a partition of the vertex set of a graph G into at most four parts A, B, C, D, with the following constraints: the internal constraints are part A and part B are required to be independent sets, and part D is required to be a ...

A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets A_L, A_R , S_L and S_R such that: every vertex of A_L is adjacent to every vertex of A_R; no vertex of S_L is adjacent to vertex of A_R∪S_R; no vertex of S_R is adjacent ...