The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1186/s40687-016-0067-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1186/S40687-016-0067-8 / rank | |||
Normal rank | |||
Latest revision as of 16:18, 8 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems |
scientific article |
Statements
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (English)
0 references
9 September 2016
0 references
Tutte polynomial
0 references
medial graphs
0 references
Eulerian partitions
0 references
Puiseux series
0 references
0 references
