The Complexity of Colouring by Semicomplete Digraphs (Q3834066)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Colouring by Semicomplete Digraphs |
scientific article |
Statements
The Complexity of Colouring by Semicomplete Digraphs (English)
0 references
1988
0 references
graph colouring
0 references
graph homomorphism
0 references
complexity
0 references
polynomial algorithm
0 references
NP-completeness
0 references
tournaments
0 references
H-colouring problem
0 references
directed graph
0 references
semicomplete digraphs
0 references
T-colouring problem
0 references
