Skip to search formSkip to main contentSkip to account menu

Graph sandwich problem

Known as: Graph Sandwich Problems 
In graph theory and computer science, the graph sandwich problem is a problem of finding a graph that belongs to a particular family of graphs and is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A cograph is a graph without induced P4 (where P4 denotes an induced path with 4 vertices). A graph G is (k, `) if its vertex set… 
2013
2013
In this work we consider the Golumbic, Kaplan and Shamir graph sandwich decision problem for property Π, where given two graphs G… 
2011
2011
In the Intervalizing Coloured Graphs problem, one must decide for a given graph G = (V, E) with a proper vertex colouring of G… 
2007
2007
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… 
2005
2005
2005
2005
1998
1998
Abstract. The ℱ Hypergraph Sandwich Problem (ℱHSP) is introduced here as follows: Given two hypergraphs H1=(X,ℰ1) and H2=(X,ℰ2… 
1992
1992
Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals…