Projects per year
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.
Original language | English |
---|---|
Title of host publication | Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers |
Editors | Patrizio Angelini, Reinhard von Hanxleden |
Publisher | Springer Science and Business Media Deutschland GmbH |
Pages | 16-24 |
Number of pages | 9 |
ISBN (Electronic) | 978-303122202-3 |
ISBN (Print) | 9783031222023 |
DOIs | |
Publication status | Published - 2023 |
Event | 30th International Symposium on Graph Drawing and Network Visualization: GD 2022 - Tokyo, Japan Duration: 13 Sept 2022 → 16 Jan 2023 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 13764 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 30th International Symposium on Graph Drawing and Network Visualization |
---|---|
Abbreviated title | GD 2022 |
Country/Territory | Japan |
City | Tokyo |
Period | 13/09/22 → 16/01/23 |
Keywords
- Compatibility graph
- Plane spanning tree
- Simple drawing
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science
Fields of Expertise
- Information, Communication & Computing
Fingerprint
Dive into the research topics of 'Compatible Spanning Trees in Simple Drawings of Kn'. Together they form a unique fingerprint.-
Doctoral Program: Discrete Mathematics
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
Project: Research project
-
Activities
- 1 Talk at conference or symposium
-
Compatible Spanning Trees in Simple Drawings of Kn
Rosna Paul (Speaker)
13 Sept 2022 → 16 Sept 2022Activity: Talk or presentation › Talk at conference or symposium › Science to science