Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jct/SharirSW13, #quickstatements; #temporary_batch_1731475607626 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcta.2013.01.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2569928643 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jct/SharirSW13 / rank | |||
Normal rank | |||
Latest revision as of 06:49, 13 November 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
