{"year":"2020","oa":1,"abstract":[{"text":"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.","lang":"eng"}],"publication_status":"published","month":"04","date_created":"2024-03-05T08:57:17Z","main_file_link":[{"url":"https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/data/uploads/papers/eurocg20_paper_56.pdf","open_access":"1"}],"author":[{"last_name":"Aichholzer","first_name":"Oswin","full_name":"Aichholzer, Oswin"},{"last_name":"Obmann","first_name":"Julia","full_name":"Obmann, Julia"},{"id":"B593B804-1035-11EA-B4F1-947645A5BB83","full_name":"Patak, Pavel","last_name":"Patak","first_name":"Pavel"},{"full_name":"Perz, Daniel","first_name":"Daniel","last_name":"Perz"},{"full_name":"Tkadlec, Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","last_name":"Tkadlec"}],"publication":"36th European Workshop on Computational Geometry","day":"01","language":[{"iso":"eng"}],"date_updated":"2024-03-05T09:00:07Z","article_number":"56","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"},{"_id":"UlWa"}],"oa_version":"Published Version","acknowledgement":"Research on this work was initiated at the 6th Austrian-Japanese-Mexican-Spanish Workshop on Discrete Geometry and continued during the 16th European Geometric Graph-Week, both held near Strobl, Austria. We are grateful to the participants for the inspiring atmosphere. We especially thank Alexander Pilz for bringing this class of problems to our attention and Birgit Vogtenhuber for inspiring discussions. D.P. is partially supported by the FWF grant I 3340-N35 (Collaborative DACH project Arrangements and Drawings). The research stay of P.P. at IST Austria is funded by the project CZ.02.2.69/0.0/0.0/17_050/0008466 Improvement of internationalization in the field of research and development at Charles University, through the support of quality projects MSCA-IF. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 734922.","title":"Disjoint tree-compatible plane perfect matchings","citation":{"short":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.","apa":"Aichholzer, O., Obmann, J., Patak, P., Perz, D., &#38; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In <i>36th European Workshop on Computational Geometry</i>. Würzburg, Germany, Virtual.","ama":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: <i>36th European Workshop on Computational Geometry</i>. ; 2020.","chicago":"Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In <i>36th European Workshop on Computational Geometry</i>, 2020.","ieee":"O. Aichholzer, J. Obmann, P. Patak, D. Perz, and J. Tkadlec, “Disjoint tree-compatible plane perfect matchings,” in <i>36th European Workshop on Computational Geometry</i>, Würzburg, Germany, Virtual, 2020.","ista":"Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. 2020. Disjoint tree-compatible plane perfect matchings. 36th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 56.","mla":"Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” <i>36th European Workshop on Computational Geometry</i>, 56, 2020."},"article_processing_charge":"No","_id":"15082","status":"public","conference":{"name":"EuroCG: European Workshop on Computational Geometry","start_date":"2020-03-16","location":"Würzburg, Germany, Virtual","end_date":"2020-03-18"},"date_published":"2020-04-01T00:00:00Z","quality_controlled":"1"}