The graph sandwich problem for 1-join composition is NP-complete (Q2816076)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The graph sandwich problem for 1-join composition is NP-complete |
scientific article; zbMATH DE number 6600264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The graph sandwich problem for 1-join composition is NP-complete |
scientific article; zbMATH DE number 6600264 |
Statements
1 July 2016
0 references
computational complexity
0 references
graph algorithms
0 references
sandwich problems
0 references
perfect graphs
0 references
The graph sandwich problem for 1-join composition is NP-complete (English)
0 references
