The complexity of counting planar graph homomorphisms of domain size 3 (Q6499302)
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 counting planar graph homomorphisms of domain size 3 |
scientific article; zbMATH DE number 7844671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of counting planar graph homomorphisms of domain size 3 |
scientific article; zbMATH DE number 7844671 |
Statements
The complexity of counting planar graph homomorphisms of domain size 3 (English)
0 references
8 May 2024
0 references
complexity dichotomy
0 references
non-Boolean domain
0 references
planar graph homomorphism
0 references
0 references
0 references
