1. Aichholzer, O., Hackl, Th., Korman, M., van Kreveld, M., Loffler, M., Pilz, A., Speckmann, B., Welzl, E.: Packing plane spanning trees and paths in complete geometric graphs. In: 26th Canadian Conference on Computational Geometry (Halifax 2014), pp. 233–238. Carleton University, Ottawa (2014)
2. Aichholzer, O., Obenaus, J., Orthaber, J., Paul, R., Schnider, P., Steiner, R., Taubner, T., Vogtenhuber, B.: Edge partitions of complete geometric graphs. In: 38th International Symposium on Computational Geometry (Berlin 2022). Leibniz Int. Proc. Inform., vol. 224, # 6. Leibniz-Zent. Inform., Wadern (2022)
3. Araujo, G., Dumitrescu, A., Hurtado, F., Noy, M., Urrutia, J.: On the chromatic number of some geometric type Kneser graphs. Comput. Geom. 32(1), 59–69 (2005)
4. Aronov, B., Erdős, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica 14(2), 127–134 (1994)
5. Bose, P., Hurtado, F., Rivera-Campo, E., Wood, D.R.: Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2), 116–125 (2006)