We solve a problem of Dujmovi\'c and Wood (2007) by showing that a complete convex geometric graph on $n$ vertices cannot be decomposed into fewer than $n-1$ star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.

翻译：我们解决了Dujmovi\'c和Wood（2007）提出的一个问题，证明了包含$n$个顶点的完全凸几何图无法分解为少于$n-1$个星形森林（每个星形森林由非交叉边组成）。该下界显然是紧的。我们还讨论了抽象图上的类似问题。