Bichromatic compatible matchings

DOI10.1145/2462356.2462379MaRDI QIDQ5174487zbMATH OpenOpenAlexFDO

Authors Greg Aloupis, Stefan Langerman, Diane L. Souvaine, 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

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

Recommendations

• Bichromatic compatible matchings
• Linear transformation distance for bichromatic matchings
• Linear transformation distance for bichromatic matchings
• Quasi-parallel segments and characterization of unique bichromatic matchings
• Structural properties of bichromatic non-crossing matchings

Cited in

(6)

• Linear transformation distance for bichromatic matchings
• Disjoint compatibility graph of non-crossing matchings of points in convex position
• Bichromatic compatible matchings
• Quasi-parallel segments and characterization of unique bichromatic matchings
• Random Bichromatic Matchings
• Separable drawings: extendability and crossing-free Hamiltonian cycles

This page was built for publication: Bichromatic compatible matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174487)