Projekte pro Jahr
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.
Originalsprache | englisch |
---|---|
Titel | Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers |
Redakteure/-innen | Patrizio Angelini, Reinhard von Hanxleden |
Herausgeber (Verlag) | Springer Science and Business Media Deutschland GmbH |
Seiten | 16-24 |
Seitenumfang | 9 |
ISBN (elektronisch) | 978-303122202-3 |
ISBN (Print) | 9783031222023 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2023 |
Veranstaltung | 30th International Symposium on Graph Drawing and Network Visualization: GD 2022 - Tokyo, Japan Dauer: 13 Sept. 2022 → 16 Jan. 2023 |
Publikationsreihe
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Band | 13764 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (elektronisch) | 1611-3349 |
Konferenz
Konferenz | 30th International Symposium on Graph Drawing and Network Visualization |
---|---|
Kurztitel | GD 2022 |
Land/Gebiet | Japan |
Ort | Tokyo |
Zeitraum | 13/09/22 → 16/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.-
DK Diskrete Mathematik
Ebner, O., Lehner, F., Greinecker, F., Burkard, R., Wallner, J., Elsholtz, C., Woess, W., Raseta, M., Bazarova, A., Krenn, D., Lehner, F., Kang, M., Tichy, R., Sava-Huss, E., Klinz, B., Heuberger, C., Grabner, P., Barroero, F., Cuno, J., Kreso, D., Berkes, I. & Kerber, M.
1/05/10 → 30/06/24
Projekt: Forschungsprojekt
-
Aktivitäten
- 1 Vortrag bei Konferenz oder Fachtagung
-
Compatible Spanning Trees in Simple Drawings of Kn
Rosna Paul (Redner/in)
13 Sept. 2022 → 16 Sept. 2022Aktivität: Vortrag oder Präsentation › Vortrag bei Konferenz oder Fachtagung › Science to science