@article{22b794e8d18142819549b5f626d9482d,
title = "Packing plane spanning trees and paths in complete geometric graphs",
abstract = "We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane? We show that this number is in Ω(n). Further, we consider variants of this problem by bounding the diameter and the degree of the trees (in particular considering spanning paths).",
keywords = "Combinatorial problems, Edge disjoint graphs, Geometric graph, Spanning tree",
author = "Oswin Aichholzer and Thomas Hackl and Matias Korman and {van Kreveld}, Marc and Maarten L{\"o}ffler and Alexander Pilz and Bettina Speckmann and Emo Welzl",
note = "Funding Information: This work was presented at the 26th Canadian Conference on Computational Geometry (CCCG 2014), Halifax, Nova Scotia, Canada, 2014. Research was initiated during the 10th European Research Week on Geometric Graphs (GGWeek 2013), Illgau, Switzerland. T.H. was supported by the Austrian Science Fund (FWF): P23629-N18. M.K. was partially supported by MEXT KAKENHI No. 17K12635. A.P. is supported by an Erwin Schr?dinger fellowship of the Austrian Science Fund (FWF): J-3847-N35. Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",
year = "2017",
month = aug,
day = "1",
doi = "10.1016/j.ipl.2017.04.006",
language = "English",
volume = "124",
pages = "35--41",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
}