Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
type: Item
instance of: scholarly article
title: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
zbMATH Open document ID: 1262.05035
author: Adam Sheffer
author: Micha Sharir
author: Emo Welzl
published in: Journal of Combinatorial Theory. Series A
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6154115
zbMATH Keywords: spanning cycle
zbMATH Keywords: perfect matching
zbMATH Keywords: Kasteleyn's theorem
zbMATH Keywords: triangulation
zbMATH Keywords: plane graph
Wikidata QID: Q54308610
MaRDI profile type: Publication
full work available at URL: j.jcta.2013.01.002
OpenAlex ID: W2569928643
DBLP publication ID: journals/jct/SharirSW13
DOI: 10.1016/J.JCTA.2013.01.002
description: scientific article; zbMATH DE number 6154115