Recommendations
- On compatible matchings
- scientific article; zbMATH DE number 3914366
- On optimal matchings
- Compatible geometric matchings
- Compatible Geometric Matchings
- On matchings in graphs
- Perfect matchings and applications
- On induced matchings
- Essentially stable matchings
- scientific article; zbMATH DE number 6863588
Cites work
- A central approach to bound the number of crossings in a generalized configuration
- Algorithms and Computation
- Applications of the crossing number
- Bichromatic compatible matchings
- Compatible geometric matchings
- Compatible triangulations and point partitions by series-triangular graphs
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- Counting triangulations of planar point sets
- Disjoint compatible geometric matchings
- Erdős-Szekeres theorem for cyclic permutations
- Generating pseudo-random permutations and maximum flow algorithms
- Graph Drawing
- How to morph planar graph drawings
- How to morph tilings injectively
- Linear transformation distance for bichromatic matchings
- On compatible matchings
- On compatible triangulations of simple polygons
- On compatible triangulations with a minimum number of Steiner points
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- The rectilinear crossing number of K_n: closing in (or are we?)
- Towards compatible triangulations.
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(7)- Almost exact matchings
- On the problem of optimal compatibility
- Selecting Complementary Pairs of Literals
- Disjoint compatible geometric matchings
- Near-perfect non-crossing harmonic matchings in randomly labeled points on a circle
- Compatibility and companions for Leonard pairs
- Compatible geometric matchings
This page was built for publication: On Compatible Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5049995)
