Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734)
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 6154115
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique |
scientific article; zbMATH DE number 6154115 |
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
