Shooting Stars in Simple Drawings of Km , n

Oswin Aichholzer, Alfredo García, Irene Parada*, Birgit Vogtenhuber, Alexandra Weinberger

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Abstract

Simple drawings are drawings of graphs in which two edges have at most one common point (either a common endpoint, or a proper crossing). It has been an open question whether every simple drawing of a complete bipartite graph Km , n contains a plane spanning tree as a subdrawing. We answer this question to the positive by showing that for every simple drawing of Km , n and for every vertex v in that drawing, the drawing contains a shooting star rooted at v, that is, a plane spanning tree containing all edges incident to v.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 30th International Symposium, GD 2022, Revised Selected Papers
EditorsPatrizio Angelini, Reinhard von Hanxleden
PublisherSpringer Science and Business Media Deutschland GmbH
Pages49-57
Number of pages9
ISBN (Print)9783031222023
DOIs
Publication statusPublished - 2023
Event30th International Symposium on Graph Drawing and Network Visualization: GD 2022 - Tokyo, Japan
Duration: 13 Sept 202216 Jan 2023

Publication series

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

Conference

Conference30th International Symposium on Graph Drawing and Network Visualization
Abbreviated titleGD 2022
Country/TerritoryJapan
CityTokyo
Period13/09/2216/01/23

Keywords

  • Complete bipartite graph
  • Plane spanning tree
  • Shooting star
  • Simple drawing
  • Simple topological graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Cite this