On flips in planar matchings
From MaRDI portal
Publication:5919054
DOI10.1016/j.dam.2020.10.018zbMath1454.05098arXiv2002.02290OpenAlexW3095587871MaRDI QIDQ5919054
Martin Pergel, Marcel Milich, Torsten Mütze
Publication date: 29 December 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.02290
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) General convexity (52A99)
Related Items (2)
K-Narayana sequence self-similarity. Flip graph views of k-Narayana self-similarity ⋮ Disjoint compatibility via graph classes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Flip distance between triangulations of a simple polygon is NP-complete
- Flip distance between two triangulations of a point set is NP-complete
- Rotation distance is fixed-parameter tractable
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Balanced Gray codes
- Binary Gray codes with long bit runs
- The genus of curve, pants and flip graphs
- The associahedron and triangulations of the \(n\)-gon
- Graphs of non-crossing perfect matchings
- Graph of triangulations of a convex polygon and tree of triangulations
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Many non-equivalent realizations of the associahedron
- The diameter of associahedra
- Gray code enumeration of plane straight-line graphs
- Graphs of triangulations and perfect matchings
- Lattice Theory of the Poset of Regions
- Bi-banded Paths, a Bijection and the Narayana Numbers
- A Linear-Time Approximation Algorithm for Rotation Distance
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- On Rotations and the Generation of Binary Trees
- From the Tamari Lattice to Cambrian Lattices and Beyond
- Quotientopes
- Catalan Numbers
- Rainbow Cycles in Flip Graphs
- Eccentricities in the flip‐graphs of convex polygons
- Flip distances between graph orientations
This page was built for publication: On flips in planar matchings
