(2014) 26th Canadian Conference on Computational Geometry (CCCG) 2014 Proceedings, pp. 233 - 238
(Part of book)
Abstract
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane? show less