Pach, JánosSaghafian, MortezaSchnider, Patrick2025-04-112025-04-112025-04-112025-12-0110.1016/j.comgeo.2025.1021862-s2.0-105001555771https://infoscience.epfl.ch/handle/20.500.14299/249099We solve a problem of Dujmović 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.falseGeometric graphsGraph decompositionGraph thicknessStar foreststext::journal::journal article::research article