Compatible Spanning Trees in Simple Drawings of Kn

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

*Korrespondierende/r Autor/-in für diese Arbeit

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandBegutachtung

Abstract

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 vertices are adjacent if and only if the corresponding trees are compatible. We show, on the one hand, that F(TD) is connected if D is a cylindrical, monotone, or strongly c-monotone drawing. On the other hand, we show that the subgraph of F(TD) induced by stars, double stars, and twin stars is also connected. In all cases the diameter of the corresponding compatibility graph is at most linear in n.

Originalspracheenglisch
TitelGraph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers
Redakteure/-innenPatrizio Angelini, Reinhard von Hanxleden
Herausgeber (Verlag)Springer Science and Business Media Deutschland GmbH
Seiten16-24
Seitenumfang9
ISBN (elektronisch)978-303122202-3
ISBN (Print)9783031222023
DOIs
PublikationsstatusVeröffentlicht - 2023
Veranstaltung30th International Symposium on Graph Drawing and Network Visualization: GD 2022 - Tokyo, Japan
Dauer: 13 Sept. 202216 Jan. 2023

Publikationsreihe

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band13764 LNCS
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz30th International Symposium on Graph Drawing and Network Visualization
KurztitelGD 2022
Land/GebietJapan
OrtTokyo
Zeitraum13/09/2216/01/23

ASJC Scopus subject areas

  • Theoretische Informatik
  • Allgemeine Computerwissenschaft

Fields of Expertise

  • Information, Communication & Computing

Fingerprint

Untersuchen Sie die Forschungsthemen von „Compatible Spanning Trees in Simple Drawings of Kn“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren