Compatible Spanning Trees in Simple Drawings of Kn

Autor: Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger

Publikováno v: Lecture Notes in Computer Science, 13764
Graph Drawing and Network Visualization
Lecture Notes in Computer Science ISBN: 9783031222023

For a simple drawing D of the complete graph Kn, two (plane) subdrawings are compatible if their union is plane. Let TD be the set of all plane spanning trees on D and F(TD) be the compatibility graph that has a vertex for each element in TD and two

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adbb4bd786a09a72ec4e8d8404cb3018
https://hdl.handle.net/20.500.11850/593031