Bichromatic compatible matchings

DOI10.1145/2462356.2462379zbMath1305.05184OpenAlexW2062430434MaRDI QIDQ5174487

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

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462379

zbMATH Keywords

geometric graphsmatchingsreconfiguration problems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Disjoint compatibility graph of non-crossing matchings of points in convex position