Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q2874581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique |
scientific article; zbMATH DE number 6327769
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique |
scientific article; zbMATH DE number 6327769 |
Statements
7 August 2014
0 references
Kasteleyn's technique
0 references
perfect matchings
0 references
spanning cycles
0 references
triangulations
0 references
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (English)
0 references
