The Computational Complexity of the Tutte Plane: the Bipartite Case (Q4291212): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1369654 |
||
| Property / author | |||
| Property / author: Dominic J. A. Welsh / rank | |||
Revision as of 16:19, 27 February 2024
scientific article; zbMATH DE number 563595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Computational Complexity of the Tutte Plane: the Bipartite Case |
scientific article; zbMATH DE number 563595 |
Statements
The Computational Complexity of the Tutte Plane: the Bipartite Case (English)
0 references
5 May 1994
0 references
computational complexity
0 references
Tutte plane
0 references
Tutte polynomial
0 references
spanning trees
0 references
partition function
0 references
planar Ising model
0 references
