Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q54308610, #quickstatements; #temporary_batch_1707303357582 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q54308610 / rank | |||
Normal rank | |||
Revision as of 14:05, 7 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
