On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (Q1949105): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1205.0991 / rank | |||
Normal rank | |||
Revision as of 22:59, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs |
scientific article |
Statements
On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs (English)
0 references
25 April 2013
0 references
graph
0 references
S-prime
0 references
S-composite
0 references
path-\(k\)-coloring
0 references
Cartesian product
0 references
NP-complete
0 references
coNP-complete
0 references
