{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:17:15Z","timestamp":1742912235239,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_3","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"34-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Different Types of\u00a0Isomorphisms of\u00a0Drawings of\u00a0Complete Multipartite Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2364-0583","authenticated-orcid":false,"given":"Oswin","family":"Aichholzer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7166-4467","authenticated-orcid":false,"given":"Birgit","family":"Vogtenhuber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8553-6661","authenticated-orcid":false,"given":"Alexandra","family":"Weinberger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"key":"3_CR1","unstructured":"https:\/\/figshare.com\/s\/97449727daca12d6bbf6"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Chiu, M.K., Hoang, H.P., Hoffmann, M., Kyn\u010dl, J., Maus, Y., Vogtenhuber, B., Weinberger, A.: Drawings of complete multipartite graphs up to triangle flips. In: 39th International Symposium on Computational Geometry, LIPIcs. Leibniz International Proceedings in Informatics, vol. 258, pp. 6:1\u20136:16. Schloss Dagstuhl. Leibniz-Zent. Inform. Wadern (2023). https:\/\/doi.org\/10.4230\/lipics.socg.2023.6","DOI":"10.4230\/lipics.socg.2023.6"},{"key":"3_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-031-22203-0_5","volume-title":"Graph Drawing and Network Visualization","author":"O Aichholzer","year":"2023","unstructured":"Aichholzer, O., Garc\u00eda, A., Parada, I., Vogtenhuber, B., Weinberger, A.: Shooting stars in simple drawings of $$K_{m, n}$$. In: Angelini, P., von Hanxleden, R. (eds.) GD 2022. LNCS, vol. 13764, pp. 49\u201357. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-22203-0_5"},{"key":"3_CR4","unstructured":"Aichholzer, O., Vogtenhuber, B., Weinberger, A.: Different types of isomorphisms of drawings of complete multipartite graphs (2023). http:\/\/arxiv.org\/abs\/2308.10735v1"},{"key":"3_CR5","unstructured":"Arroyo, A., McQuillan, D., Richter, R.B., Salazar, G.: Drawings of $$K_n$$ with the same rotation scheme are the same up to triangle-flips (Gioan\u2019s theorem). Australas. J. Combin. 67, 131\u2013144 (2017). https:\/\/ajc.maths.uq.edu.au\/pdf\/67\/ajc_v67_p131.pdf"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Asano, K.: The crossing number of $$K_{1,3, n}$$ and $$K_{2,3, n}$$. J. Graph Theory 10(1), 1\u20138 (1986). https:\/\/doi.org\/10.1002\/jgt.3190100102","DOI":"10.1002\/jgt.3190100102"},{"key":"3_CR7","unstructured":"Br\u00f6tzner, A.: Isomorphism Classes of Drawings of $$K_{3,3}$$. Bachelor\u2019s thesis, Graz University of Technology (2021)"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.20382\/jocg.v9i1a7","volume":"9","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S.: Topological drawings of complete bipartite graphs. J. Comput. Geom. 9(1), 213\u2013246 (2018). https:\/\/doi.org\/10.20382\/jocg.v9i1a7","journal-title":"J. Comput. Geom."},{"key":"3_CR9","unstructured":"Fabila-Monroy, R., Paul, R., Viafara-Chanchi, J., Weinberger, A.: On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs. In: Abstracts of XX Encuentros de Geometr\u00eda Computacional (EGC 2023), pp. 33\u201336 (2023). https:\/\/egc23.web.uah.es\/wp-content\/uploads\/2023\/07\/EGC2023_Booklet.pdf#page=45"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Gethner, E., Hogben, L., Lidick\u1ef3, B., Pfender, F., Ruiz, A., Young, M.: On crossing numbers of complete tripartite and balanced complete multipartite graphs. J. Graph Theory 4(84), 552\u2013565 (2017). https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/jgt.22041","DOI":"10.1002\/jgt.22041"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11604686_13","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Gioan","year":"2005","unstructured":"Gioan, E.: Complete graph drawings up to triangle mutations. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 139\u2013150. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11604686_13"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1007\/s00454-021-00339-8","volume":"67","author":"E Gioan","year":"2022","unstructured":"Gioan, E.: Complete graph drawings up to triangle mutations. Discrete Comput. Geom. 67, 985\u20131022 (2022). https:\/\/doi.org\/10.1007\/s00454-021-00339-8","journal-title":"Discrete Comput. Geom."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/mana.19710480113","volume":"48","author":"H Harborth","year":"1971","unstructured":"Harborth, H.: \u00dcber die Kreuzungszahl vollst\u00e4ndiger, $$n$$-geteilter Graphen. Math. Nachr. 48, 179\u2013188 (1971). https:\/\/doi.org\/10.1002\/mana.19710480113","journal-title":"Math. Nachr."},{"key":"3_CR14","unstructured":"Harborth, H.: Parity of numbers of crossings for complete $$n$$-partite graphs. Mathematica Slovaca 26(2), 77\u201395 (1976). http:\/\/eudml.org\/doc\/33976"},{"key":"3_CR15","first-page":"527","volume":"109","author":"PT Ho","year":"2013","unstructured":"Ho, P.T.: The crossing number of $$K_{2,4, n}$$. Ars Combin. 109, 527\u2013537 (2013)","journal-title":"Ars Combin."},{"key":"3_CR16","doi-asserted-by":"publisher","unstructured":"Kyn\u010dl, J.: Simple realizability of complete abstract topological graphs in P. Discrete Comput. Geom. 45(3), 383\u2013399 (2011). https:\/\/doi.org\/10.1007\/s00454-010-9320-x","DOI":"10.1007\/s00454-010-9320-x"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-013-9535-8","volume":"50","author":"J Kyn\u010dl","year":"2013","unstructured":"Kyn\u010dl, J.: Improved enumeration of simple topological graphs. Discrete Comput. Geom. 50(3), 727\u2013770 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9535-8","journal-title":"Discrete Comput. Geom."},{"key":"3_CR18","unstructured":"Mengersen, I.: Kreuzungsfreie Kanten in vollst\u00e4ndigen n-geteilten Graphen. Ph.D. thesis, Technische Universit\u00e4t Braunschweig (1975)"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s11464-016-0618-8","volume":"12","author":"Z Ouyang","year":"2017","unstructured":"Ouyang, Z., Wang, J., Huang, Y.: Two recursive inequalities for crossing numbers of graphs. Front. Math. China 12(3), 703\u2013709 (2017). https:\/\/doi.org\/10.1007\/s11464-016-0618-8","journal-title":"Front. Math. China"},{"key":"3_CR20","unstructured":"Prinoth, K.: Computing exhaustive lists of complete bipartite simple drawings. Bachelor\u2019s thesis, Graz University of Technology (2021)"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Crossing numbers of graphs. Discrete Mathematics and its Applications (Boca Raton), CRC Press, Boca Raton, FL (2018). https:\/\/doi.org\/10.1201\/9781315152394","DOI":"10.1201\/9781315152394"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s00454-021-00296-2","volume":"66","author":"M Schaefer","year":"2021","unstructured":"Schaefer, M.: Taking a detour; or, Gioan\u2019s theorem, and pseudolinear drawings of complete graphs. Discrete Comput. Geom. 66, 12\u201331 (2021). https:\/\/doi.org\/10.1007\/s00454-021-00296-2","journal-title":"Discrete Comput. Geom."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Zarankiewicz, K.: On a problem of P. Turan concerning graphs. Fund. Math. 41, 137\u2013145 (1954). https:\/\/doi.org\/10.4064\/fm-41-1-137-145","DOI":"10.4064\/fm-41-1-137-145"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49275-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:11Z","timestamp":1704715391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}