Counting plane graphs

DOI10.1145/2261250.2261277zbMath1293.05307arXiv1109.5596OpenAlexW1992743664MaRDI QIDQ2874581

Adam Sheffer, Ermo Welzl, Micha Sharir

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.5596

zbMATH Keywords

triangulationsperfect matchingsspanning cyclesKasteleyn's technique

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Disjoint compatible geometric matchings ⋮ On numbers of pseudo-triangulations ⋮ An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets

This page was built for publication: Counting plane graphs