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).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.