A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261)
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 6918734
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity dichotomy for signed \(\mathbf{H}\)-colouring |
scientific article; zbMATH DE number 6918734 |
Statements
A complexity dichotomy for signed \(\mathbf{H}\)-colouring (English)
0 references
15 August 2018
0 references
signed graph
0 references
edge coloured graph
0 references
homomorphism complexity
0 references
switching
0 references
0.8243504166603088
0 references
0.8161594271659851
0 references
0.7879555821418762
0 references
0.7612072825431824
0 references
