On the complexity of colouring by superdigraphs of bipartite graphs (Q686279): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:58, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of colouring by superdigraphs of bipartite graphs |
scientific article |
Statements
On the complexity of colouring by superdigraphs of bipartite graphs (English)
0 references
14 October 1993
0 references
complexity
0 references
colouring
0 references
digraph
0 references
homomorphism
0 references
NP-complete
0 references
bipartite graph
0 references