The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178)
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 signed graph and edge-coloured graph homomorphisms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of signed graph and edge-coloured graph homomorphisms |
scientific article |
Statements
The complexity of signed graph and edge-coloured graph homomorphisms (English)
0 references
14 December 2016
0 references
signed graph
0 references
edge-coloured graph
0 references
graph homomorphism
0 references
dichotomy theorem
0 references
0.93987656
0 references
0.93308675
0 references
0.9177133
0 references
0.90492487
0 references
0.89954185
0 references
0 references
