The complexity of counting planar graph homomorphisms of domain size 3 (Q6499302): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q130994387, #quickstatements; #temporary_batch_1733741289228 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130994387 / rank | |||
Normal rank | |||
Latest revision as of 11:52, 9 December 2024
scientific article; zbMATH DE number 7844671
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
