License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SoCG.2022.6
URN: urn:nbn:de:0030-drops-160141
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16014/
Go to the corresponding LIPIcs Volume Portal


Aichholzer, Oswin ; Obenaus, Johannes ; Orthaber, Joachim ; Paul, Rosna ; Schnider, Patrick ; Steiner, Raphael ; Taubner, Tim ; Vogtenhuber, Birgit

Edge Partitions of Complete Geometric Graphs

pdf-format:
LIPIcs-SoCG-2022-6.pdf (0.9 MB)


Abstract

In this paper, we disprove the long-standing conjecture that any complete geometric graph on 2n vertices can be partitioned into n plane spanning trees. Our construction is based on so-called bumpy wheel sets. We fully characterize which bumpy wheels can and in particular which cannot be partitioned into plane spanning trees (or even into arbitrary plane subgraphs).
Furthermore, we show a sufficient condition for generalized wheels to not admit a partition into plane spanning trees, and give a complete characterization when they admit a partition into plane spanning double stars.
Finally, we initiate the study of partitions into beyond planar subgraphs, namely into k-planar and k-quasi-planar subgraphs and obtain first bounds on the number of subgraphs required in this setting.

BibTeX - Entry

@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2022.6,
  author =	{Aichholzer, Oswin and Obenaus, Johannes and Orthaber, Joachim and Paul, Rosna and Schnider, Patrick and Steiner, Raphael and Taubner, Tim and Vogtenhuber, Birgit},
  title =	{{Edge Partitions of Complete Geometric Graphs}},
  booktitle =	{38th International Symposium on Computational Geometry (SoCG 2022)},
  pages =	{6:1--6:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-227-3},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{224},
  editor =	{Goaoc, Xavier and Kerber, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16014},
  URN =		{urn:nbn:de:0030-drops-160141},
  doi =		{10.4230/LIPIcs.SoCG.2022.6},
  annote =	{Keywords: edge partition, complete geometric graph, plane spanning tree, wheel set}
}

Keywords: edge partition, complete geometric graph, plane spanning tree, wheel set
Collection: 38th International Symposium on Computational Geometry (SoCG 2022)
Issue Date: 2022
Date of publication: 01.06.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI