Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:10, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique |
scientific article |
Statements
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (English)
0 references
15 April 2013
0 references
spanning cycle
0 references
perfect matching
0 references
Kasteleyn's theorem
0 references
triangulation
0 references
plane graph
0 references
