Graphs of triangulations and perfect matchings
DOI10.1007/S00373-005-0615-2zbMATH Open1080.52001OpenAlexW2089017681MaRDI QIDQ2573802FDOQ2573802
Authors: Michael E. Houle, Marc Noy, E. Rivera-Campo, Ferran Hurtado 
Publication date: 24 November 2005
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-005-0615-2
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
- Title not available (Why is that?)
- Flipping edges in triangulations
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Generating rooted triangulations without repetitions
- Graphs of non-crossing perfect matchings
- Graph of triangulations of a convex polygon and tree of triangulations
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- On local transformation of polygons with visibility properties.
Cited In (31)
- Triangulating remnants of complete graphs
- The connectivities of leaf graphs of sets of points in the plane
- Compatible spanning trees
- Disjoint compatibility via graph classes
- Triangulability of convex graphs and convex skewness
- Matched drawability of graph pairs and of graph triples
- On flips in planar matchings
- 1-Triangle graphs and perfect neighborhood sets
- Perfect matchings of cellular graphs
- Flip graphs of bounded degree triangulations
- Flip graphs of bounded-degree triangulations
- Perfect matchings after vertex deletions
- Perfect matchings in the triangular lattice
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Crossing-free perfect matchings in wheel point sets
- Wing-triangulated graphs are perfect
- Flipping plane spanning paths
- Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings
- Fast enumeration algorithms for non-crossing geometric graphs
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- Transforming spanning trees: A lower bound
- On triangles in derangement graphs
- Compatible Geometric Matchings
- Perfect matching complexes of honeycomb graphs
- Graphs of non-crossing perfect matchings
- Compatible geometric matchings
- The Perfect Matching Reconfiguration Problem
- Flip distances between graph orientations
- Flips in planar graphs
- On the planar subdivision of a drawing of a complete graph in the plane
- Graphs with the fewest matchings
This page was built for publication: Graphs of triangulations and perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573802)
