Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
From MaRDI portal
Publication:1946734
DOI10.1016/J.JCTA.2013.01.002zbMath1262.05035DBLPjournals/jct/SharirSW13OpenAlexW2569928643WikidataQ54308610 ScholiaQ54308610MaRDI QIDQ1946734
Adam Sheffer, Ermo Welzl, Micha Sharir
Publication date: 15 April 2013
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2013.01.002
Paths and cycles (05C38) 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 (23)
Counting carambolas ⋮ On Compatible Matchings ⋮ On the Bounded-Hop Range Assignment Problem ⋮ Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ Packing 1-plane Hamiltonian cycles in complete geometric graphs ⋮ Circumscribing polygons and polygonizations for disjoint line segments ⋮ Area Optimal Polygonization Using Simulated Annealing ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ Crossings in grid drawings ⋮ An upper bound for the number of rectangulations of a planar point set ⋮ On \(k\)-gons and \(k\)-holes in point sets ⋮ A QPTAS for the base of the number of crossing-free structures on a planar point set ⋮ Colored ray configurations ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ Counting polygon triangulations is hard ⋮ On compatible matchings ⋮ Algorithmic enumeration of surrounding polygons ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Monotone paths in geometric triangulations ⋮ Counting triangulations and other crossing-free structures via onion layers
This page was built for publication: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
