On the number of crossing-free matchings, (cycles, and partitions)

DOI10.1145/1109557.1109652zbMath1192.05125OpenAlexW4243262670MaRDI QIDQ3581595

Micha Sharir, Ermo Welzl

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109652

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

On the number of plane geometric graphs ⋮ On polygons excluding point sets ⋮ Finding and enumerating Hamilton cycles in 4-regular graphs ⋮ Delineating boundaries for imprecise regions ⋮ On polygons enclosing point sets. II ⋮ Bichromatic compatible matchings

This page was built for publication: On the number of crossing-free matchings, (cycles, and partitions)