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)

Related topics

Related topics

4 relations
Computer scienceGraph theoryInduced pathMartin Charles Golumbic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Cograph-( k , ` ) Graph Sandwich Problem
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… 
2012
2012
On Two Graph-Theoretic Characterizations of Tree Compatibility
Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph… 
2009
2009
Zur Komplexität von Reduzierbarkeitsproblemen über H-Comparabilitygraphen
This thesis investigates the complexity of the following decision problem. Determine, whether a given sequence of an open-shop… 
2007
2007
The 1-join Sandwich Problem Is Np-complete
A graph is a 1-join composition, if its vertex set can be partitioned into four nonempty sets A 0 , A 1 , S 0 and S 1 such that… 
2007
2007
Efficient envelopment algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial module of a graph, i.e. a non-unitary, proper subset H of a graph’s vertices such that all… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)