Bichromatic compatible matchings

DOI10.1016/j.comgeo.2014.08.009zbMath1316.05097arXiv1207.2375OpenAlexW2209009633MaRDI QIDQ2354926

Stefan Langerman, Luis Barba, Greg Aloupis, Diane L. Souvaine

Publication date: 27 July 2015

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.2375

zbMATH Keywords

perfect matchingsreconfiguration problembichromatic point settransformation graphcompatible matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

On Compatible Matchings ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ On maximum-sum matchings of points ⋮ Matching points with disks with a common intersection ⋮ Compatible spanning trees in simple drawings of \(K_n\) ⋮ Linear transformation distance for bichromatic matchings ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ On compatible matchings ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Transition operations over plane trees ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations.

Cites Work

• Pointed binary encompassing trees: simple and optimal
• Compatible geometric matchings
• Augmenting the connectivity of geometric graphs
• Transforming spanning trees: A lower bound
• Transforming spanning trees and pseudo-triangulations
• Triangulations, visibility graph and reflex vertices of a simple polygon
• Flipping edges in triangulations
• Encompassing colored planar straight line graphs
• Plane Geometric Graph Augmentation: A Generic Perspective
• On the number of crossing-free matchings, (cycles, and partitions)
• Linear transformation distance for bichromatic matchings
• Disjoint compatible geometric matchings
• Sequences of spanning trees and a fixed tree theorem

This page was built for publication: Bichromatic compatible matchings