The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2412274288 / rank | |||
Normal rank | |||
Revision as of 02:03, 20 March 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
