---
res:
  bibo_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 tree-compatible if there
    exists a plane drawing of a spanning tree T on S which is disjoint compatible
    to both M1 and M2.\r\nWe show that the graph of all disjoint tree-compatible perfect
    geometric matchings on 2n points in convex position is connected if and only if
    2n ≥ 10. Moreover, in that case the diameter\r\nof this graph is either 4 or 5,
    independent of n.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Oswin
      foaf_name: Aichholzer, Oswin
      foaf_surname: Aichholzer
  - foaf_Person:
      foaf_givenName: Julia
      foaf_name: Obmann, Julia
      foaf_surname: Obmann
  - foaf_Person:
      foaf_givenName: Pavel
      foaf_name: Patak, Pavel
      foaf_surname: Patak
      foaf_workInfoHomepage: http://www.librecat.org/personId=B593B804-1035-11EA-B4F1-947645A5BB83
  - foaf_Person:
      foaf_givenName: Daniel
      foaf_name: Perz, Daniel
      foaf_surname: Perz
  - foaf_Person:
      foaf_givenName: Josef
      foaf_name: Tkadlec, Josef
      foaf_surname: Tkadlec
      foaf_workInfoHomepage: http://www.librecat.org/personId=3F24CCC8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-1097-9684
  dct_date: 2020^xs_gYear
  dct_language: eng
  dct_title: Disjoint tree-compatible plane perfect matchings@
...