{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:19:03Z","timestamp":1757621943725,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032002808"},{"type":"electronic","value":"9783032002815"}],"license":[{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T00:00:00Z","timestamp":1754870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-00281-5_13","type":"book-chapter","created":{"date-parts":[[2025,8,10]],"date-time":"2025-08-10T11:38:22Z","timestamp":1754825902000},"page":"210-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partitions of\u00a0Complete Twisted Graphs Into Plane Spanning Trees"],"prefix":"10.1007","author":[{"given":"Ana Paulina","family":"Figueroa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Rivera-Campo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"\u00c1brego, B. M., Fern\u00e1ndez-Merchant, S., Figueroa, A. P., Montellano-Ballesteros, J. J., Rivera-Campo, E., The Crossing Number of Twisted Graphs, Graphs and Combinatorics, Volume 38 (2022), Article number: 134","DOI":"10.1007\/s00373-022-02538-3"},{"key":"13_CR2","unstructured":"Aichholzer, O., Obenaus, J., Orthaber, J., Paul, R., Schnider, P. , Steiner, R., Taubner, T., Vogtenhuber, V., Edge Partitions of Complete Geometric Graphs, 38th International Symposium on Computational Geometry (SoCG 2022), 6:1 \u2013 6:16"},{"key":"13_CR3","unstructured":"Arroyo, A., Richter, R. B., Salazar, G., Sullivan, M., The unavoidable rotation systems, arXiv:1910.12834"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory, Series B 27(3), 320\u2013331 (1979)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.comgeo.2005.08.006","volume":"34","author":"P Bose","year":"2006","unstructured":"Bose, P., Hurtado, F., Rivera-Campo, E., Wood, D.R.: Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2), 116\u2013125 (2006)","journal-title":"Comput. Geom."},{"key":"13_CR6","first-page":"463","volume":"2","author":"P Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"key":"13_CR7","unstructured":"Erd\u0151s, P., Szekeres, G., On some extremum problems in elementary geometry. Ann. Univ. Sci. Bp. Rolan do E\u0151tv\u0151s Nomin., Sect. Math. III-IV (1960\u20131961), 53 \u2013 62"},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s40590-020-00287-y","volume":"26","author":"AP Figueroa","year":"2020","unstructured":"Figueroa, A.P., Fres\u00e1n-Figueroa, J.: The biplanar tree graph. Bolet\u00edn de la Sociedad Matem\u00e1tica Mexicana 26(3), 795\u2013806 (2020). https:\/\/doi.org\/10.1007\/s40590-020-00287-y","journal-title":"Bolet\u00edn de la Sociedad Matem\u00e1tica Mexicana"},{"key":"13_CR9","first-page":"225","volume":"88","author":"H Harborth","year":"1992","unstructured":"Harborth, H., Mengersen, I.: Drawings of the complete graph with maximum number of crossings. Congr. Numer. 88, 225\u2013228 (1992)","journal-title":"Congr. Numer."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0012-365X(83)90275-3","volume":"46","author":"F Jaeger","year":"1983","unstructured":"Jaeger, F., Payan, C., Kouider, M.: Partition of odd regular graphs into bistars. Discrete Math. 46, 93\u201394 (1983)","journal-title":"Discrete Math."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Oma\u00f1a-Pulido, E., Rivera-Campo, E., Notes in twisted graphs, in M\u00e1rquez, Alberto (ed.) et al., Computational Geometry, Lecture Notes in Computer Science 7579, (2012), 119 \u2013 125","DOI":"10.1007\/978-3-642-34191-5_11"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. Discrete Comput. Geom. 30, 311\u2013320 (2003)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry, Graphs, and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00281-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T16:10:46Z","timestamp":1757347846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00281-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,11]]},"ISBN":["9783032002808","9783032002815"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00281-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,11]]},"assertion":[{"value":"11 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"JCDCGGG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japanese Conference on Discrete and Computational Geometry, Graphs, and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jcdcg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.alg.cei.uec.ac.jp\/itohiro\/JCDCGG\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}