On compatible matchings
From MaRDI portal
Publication:2232249
DOI10.1007/978-3-030-68211-8_18OpenAlexW3133789632MaRDI QIDQ2232249
Alan Arroyo, Zuzana Masárová, Birgit Vogtenhuber, Alexander Pilz, Irene Parada, Daniel Perz, Oswin Aichholzer, Josef Tkadlec
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/2101.03928
Related Items (1)
Cites Work
- Unnamed Item
- Counting triangulations of planar point sets
- Compatible geometric matchings
- How to morph tilings injectively
- Towards compatible triangulations.
- Erdős-Szekeres theorem for cyclic permutations
- Linear transformation distance for bichromatic matchings
- Applications of the crossing number
- Disjoint compatible geometric matchings
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Bichromatic compatible matchings
- On compatible triangulations of simple polygons
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- A central approach to bound the number of crossings in a generalized configuration
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants
- Algorithms and Computation
- How to Morph Planar Graph Drawings
- Graph Drawing
This page was built for publication: On compatible matchings
