Crossing-Free Perfect Matchings in Wheel Point Sets
From MaRDI portal
Publication:4604397
DOI10.1007/978-3-319-44479-6_30zbMath1387.05034OpenAlexW2761584990MaRDI QIDQ4604397
Andres J. Ruiz-Vargas, Ermo Welzl
Publication date: 26 February 2018
Published in: A Journey Through Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44479-6_30
Related Items (2)
Tukey depth histograms ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-crossing matchings of points with geometric objects
- Approximating the bottleneck plane perfect matching of a point set
- On a triangle counting problem
- Compatible geometric matchings
- Points surrounding the origin
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Point sets with many non-crossing perfect matchings
- Enumerating order types for small point sets with applications
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Bichromatic compatible matchings
- Graphs of triangulations and perfect matchings
- Multidimensional Sorting
- Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Lectures on Polytopes
- From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
- Counting and Enumerating Crossing-free Geometric Graphs
- Catalan Numbers
- A Generalization of Radon's Theorem
- Order on Order Types
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Entering and leaving \(j\)-facets
- A continuous analogue of the upper bound theorem
This page was built for publication: Crossing-Free Perfect Matchings in Wheel Point Sets
