On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs (Q3977296)
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: On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs |
scientific article; zbMATH DE number 14945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs |
scientific article; zbMATH DE number 14945 |
Statements
On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs (English)
0 references
25 June 1992
0 references
graph colouring
0 references
graph homomorphism
0 references
NP-completeness
0 references
polynomial algorithm
0 references
vertex-transitive graphs
0 references
0.858493983745575
0 references
0.856277346611023
0 references
0.8481789231300354
0 references
