Linear transformation distance for bichromatic matchings

DOI10.1016/j.comgeo.2017.05.003zbMath1380.05050arXiv1312.0884OpenAlexW2612435103MaRDI QIDQ1699281

Birgit Vogtenhuber, Thomas Hackl, Oswin Aichholzer, Alexander Pilz, Luis Barba

Publication date: 19 February 2018

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

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

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) Coloring of graphs and hypergraphs (05C15)

Related Items

On Compatible Matchings ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Compatible spanning trees in simple drawings of \(K_n\) ⋮ On compatible matchings ⋮ Structural properties of bichromatic non-crossing matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Problem-solving through problems
• Vertex-colored encompassing graphs
• Compatible geometric matchings
• Algorithms for ham-sandwich cuts
• Ray shooting in polygons using geodesic triangulations
• Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
• Disjoint compatible geometric matchings
• Bichromatic compatible matchings
• Encompassing colored planar straight line graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:2970420 Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings]
• Shooting Permanent Rays among Disjoint Polygons in the Plane
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Linear transformation distance for bichromatic matchings