This thesis consists of two parts. In the second part the research papers that constitute the
new results of the thesis are presented. In this first part we want to put these results in a …

A graph G is (k, l) if its vertex set can be partitioned into at most k independent sets and l
cliques. The (k, l)-Graph Sandwich Problem asks, given two graphs G1=(V, E1) and G2=(V …

Golumbic, Kaplan, and Shamir, in their paper [MC Golumbic, H. Kaplan, R. Shamir, Graph
sandwich problems, J. Algorithms 19 (1995) 449–473] on graph sandwich problems …

A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL,
AR, SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no vertex of …

The Clay Mathematics Institute has selected seven Millennium Problems to motivate
research on important classic questions that have resisted solution over the years. Among …

The Π Matrix Sandwich Problem (Π-MSP) is introduced here as follows: Given a {0, 1,∗}
valued matrix A, where∗ is interpreted as “do not care”, does there exist a fill-in of the …

The P4-sparse Graph Sandwich Problem asks, given two graphs G1=(V, E1) and G2=(V,
E2), whether there exists a graph G=(V, E) such that E1⊆ E⊆ E2 and G is P4-sparse. In this …

We consider the sandwich problem, a generalization of the recognition problem introduced
by Golumbic et al.(1995)[15], with respect to classes of graphs defined by excluding induced …

A set H of vertices of graph G (V, E) is a homogeneous set if each vertex in V\H is either
adjacent to all vertices of H or to none of the vertices in H, where V and E are the vertex set …

The polynomial dichotomy for three nonempty part sandwich problems - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …