The complexity of colouring by locally semicomplete digraphs (Q709314)
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 complexity of colouring by locally semicomplete digraphs |
scientific article; zbMATH DE number 5801211
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of colouring by locally semicomplete digraphs |
scientific article; zbMATH DE number 5801211 |
Statements
The complexity of colouring by locally semicomplete digraphs (English)
0 references
18 October 2010
0 references
digraph homomorphism
0 references
complexity
0 references
polynomial algorithm
0 references
NP-completeness
0 references
locally semicomplete digraphs
0 references
