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… 
2015
2015
A cograph is a graph without induced $$P_4$$. A graph G is $$k,\ell $$ if its vertex set can be partitioned into at most k… 
2014
2014
In this work, we consider the graph sandwich decision problem for property Π, introduced by Golumbic, Kaplan and Shamir: given… 
2013
2013
The original graph sandwich problem for a property Π, as defined by Golumbic, Kaplan, and Shamir, can be stated as follows: given… 
2012
2012
The graph sandwich problem for property Π is defined as follows: Given two graphs G1=(V,E1) and G2=(V,E2) such that E1⊆E2, is… 
2005
2005
2005
2005
2004
2004
1998
1998
Abstract. The ℱ Hypergraph Sandwich Problem (ℱHSP) is introduced here as follows: Given two hypergraphs H1=(X,ℰ1) and H2=(X,ℰ2…