@inproceedings{15012,
  abstract     = {We 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.},
  author       = {Pach, János and Saghafian, Morteza and Schnider, Patrick},
  booktitle    = {31st International Symposium on Graph Drawing and Network Visualization},
  isbn         = {9783031492716},
  issn         = {1611-3349},
  location     = {Isola delle Femmine, Palermo, Italy},
  pages        = {339--346},
  publisher    = {Springer Nature},
  title        = {{Decomposition of geometric graphs into star-forests}},
  doi          = {10.1007/978-3-031-49272-3_23},
  volume       = {14465},
  year         = {2024},
}