Graphs of triangulations and perfect matchings

DOI10.1007/S00373-005-0615-2MaRDI QIDQ2573802zbMATHOpenAlexFDO

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

zbMATH Keywords

TriangulationPerfect matchingNon-crossing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• Graphs of non-crossing perfect matchings
• Triangulations intersect nicely
• Compatible geometric matchings
• scientific article; zbMATH DE number 4025481
• Disjoint compatibility graph of non-crossing matchings of points in convex position

Cites work

• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• Flipping edges in triangulations
• Generating rooted triangulations without repetitions
• Graph of triangulations of a convex polygon and tree of triangulations
• Graphs of non-crossing perfect matchings
• On local transformation of polygons with visibility properties.
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS

Cited in

(31)

• Wing-triangulated graphs are perfect
• Flip graphs of bounded-degree triangulations
• Perfect matchings in the triangular lattice
• Graphs of non-crossing perfect matchings
• On triangles in derangement graphs
• Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings
• Matched drawability of graph pairs and of graph triples
• Flipping plane spanning paths
• Triangulability of convex graphs and convex skewness
• The Perfect Matching Reconfiguration Problem
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
• 1-Triangle graphs and perfect neighborhood sets
• On flips in planar matchings
• Perfect matchings of cellular graphs
• Flip distances between graph orientations
• Flips in planar graphs
• Transforming spanning trees: A lower bound
• Perfect matching complexes of honeycomb graphs
• Flip graphs of bounded degree triangulations
• Crossing-free perfect matchings in wheel point sets
• On the planar subdivision of a drawing of a complete graph in the plane
• Fast enumeration algorithms for non-crossing geometric graphs
• Disjoint compatibility graph of non-crossing matchings of points in convex position
• Compatible geometric matchings
• Graphs with the fewest matchings
• Compatible spanning trees
• Triangulating remnants of complete graphs
• The connectivities of leaf graphs of sets of points in the plane
• Disjoint compatibility via graph classes
• Perfect matchings after vertex deletions
• Compatible Geometric 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)