Disjoint compatibility via graph classes

DOI10.1007/978-3-031-15914-5_2OpenAlexW4312378561MaRDI QIDQ6043176

Daniel Perz, Birgit Vogtenhuber, Pavel Paták, Julia Obmann, Oswin Aichholzer, Josef Tkadlec

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15914-5_2

zbMATH Keywords

convex setmatchingscompatibility

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Compatible geometric matchings
• Graphs of non-crossing perfect matchings
• Disjoint compatible geometric matchings
• Disjoint compatibility graph of non-crossing matchings of points in convex position
• Graphs of triangulations and perfect matchings
• Plane Geometric Graph Augmentation: A Generic Perspective
• Augmenting Geometric Graphs with Matchings
• On flips in planar matchings

This page was built for publication: Disjoint compatibility via graph classes