Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:19, 5 March 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
