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 the normal view instead:
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
Given a fixed digraph \(H\), the \(H\)-colouring problem is: For a given digraph \(D\), does there exist an \(H\)-colouring of \(D\) --- that is, a function (homomorphism) \(f: V(D)\to V(H)\) such that \(f(x)f(y)\) is an arc in \(H\) whenever \(xy\) is an arc in \(D\)? The author investigates the complexity of this problem, for \(H\) either vertex-transitive or arc-transitive, obtaining a complete classification in each case. In the vertex-transitive case, the \(H\)-colouring problem is shown to be NP-complete unless \(H\) admits a retraction to a directed cycle, in which case the problem is polynomial. A similar classification for arc-transitive digraphs is deduced as a corollary.
0 references
