Activities per year
Abstract
Two plane drawings of geometric graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. For a given set S of 2n points two
plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint treecompatible if there exists a plane drawing of a spanning tree T on S which is
disjoint compatible to both M1 and M2.
We show that the graph of all disjoint treecompatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter
of this graph is either 4 or 5, independent of n.
plane drawings of perfect matchings M1 and M2 (which do not need to be disjoint nor compatible) are disjoint treecompatible if there exists a plane drawing of a spanning tree T on S which is
disjoint compatible to both M1 and M2.
We show that the graph of all disjoint treecompatible perfect geometric matchings on 2n points in convex position is connected if and only if 2n ≥ 10. Moreover, in that case the diameter
of this graph is either 4 or 5, independent of n.
Original language  English 

Pages  56:1 
Publication status  Published  2020 
Event  36th European Workshop on Computational Geometry  University of Würzburg, Virtuell, Germany Duration: 16 Mar 2020 → 18 Mar 2020 https://www1.pub.informatik.uniwuerzburg.de/eurocg2020/ 
Conference
Conference  36th European Workshop on Computational Geometry 

Abbreviated title  EuroCG 2020 
Country/Territory  Germany 
City  Virtuell 
Period  16/03/20 → 18/03/20 
Internet address 
Fingerprint
Dive into the research topics of 'Disjoint treecompatible plane perfect matchings'. Together they form a unique fingerprint.Activities
 1 Conference or symposium (Participation in/Organisation of)

36th European Workshop on Computational Geometry
Daniel Perz (Participant)
16 Mar 2020 → 18 Mar 2020Activity: Participation in or organisation of › Conference or symposium (Participation in/Organisation of)