On Compatible Matchings
From MaRDI portal
Publication:5049995
DOI10.7155/jgaa.00591zbMath1498.05253OpenAlexW4285152712MaRDI QIDQ5049995
Alan Arroyo, Alexander Pilz, Josef Tkadlec, Irene Parada, Birgit Vogtenhuber, Daniel Perz, Oswin Aichholzer, Zuzana Masárová
Publication date: 14 November 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00591
Cites Work
- Unnamed Item
- Counting triangulations of planar point sets
- Generating pseudo-random permutations and maximum flow algorithms
- 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
- On compatible triangulations with a minimum number of Steiner points
- On compatible matchings
- Bichromatic compatible matchings
- On compatible triangulations of simple polygons
- Compatible triangulations and point partitions by series-triangular graphs
- The Rectilinear Crossing Number of K n : Closing in (or Are We?)
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- A central approach to bound the number of crossings in a generalized configuration
- Algorithms and Computation
- How to Morph Planar Graph Drawings
- Graph Drawing
This page was built for publication: On Compatible Matchings
