On the complexity of colouring by superdigraphs of bipartite graphs (Q686279)
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 superdigraphs of bipartite graphs |
scientific article; zbMATH DE number 428124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of colouring by superdigraphs of bipartite graphs |
scientific article; zbMATH DE number 428124 |
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
0.8547692894935608
0 references
0.849739670753479
0 references
0.8475310802459717
0 references
0.8429805040359497
0 references
