Edge Partitions of Complete Geometric Graphs (Part 2)
Combinatorics
2021-12-17 v1 Computational Geometry
Abstract
Recently, the second and third author showed that complete geometric graphs on vertices in general cannot be partitioned into plane spanning trees. Building up on this work, in this paper, we initiate the study of partitioning into beyond planar subgraphs, namely into -planar and -quasi-planar subgraphs and obtain first bounds on the number of subgraphs required in this setting.
Keywords
Cite
@article{arxiv.2112.08456,
title = {Edge Partitions of Complete Geometric Graphs (Part 2)},
author = {Oswin Aichholzer and Johannes Obenaus and Joachim Orthaber and Rosna Paul and Patrick Schnider and Raphael Steiner and Tim Taubner and Birgit Vogtenhuber},
journal= {arXiv preprint arXiv:2112.08456},
year = {2021}
}