3 research outputs found
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
International audienceThe graph sandwich problem asks, for a pair of graphs and with , whether thereexists a graph that satisfies property and. We consider the property of being-free, where is a fixed graph. We show that the claw-freegraph sandwich and the bull-free graph sandwich problems are bothNP-complete, but the paw-free graph sandwich problem is polynomial.This completes the study of all cases where has at most fourvertices. A skew partition of a graph is a partition of itsvertex set into four nonempty parts such that each vertexof is adjacent to each vertex of , and each vertex of isnonadjacent to each vertex of . We prove that the skew partitionsandwich problem is NP-complete, establishing a computationalcomplexity non-monotonicity