{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:06:11Z","timestamp":1766365571348,"version":"3.48.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030929305"},{"type":"electronic","value":"9783030929312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92931-2_7","type":"book-chapter","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T11:14:17Z","timestamp":1640171657000},"page":"101-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Short Proof of\u00a0the\u00a0Non-biplanarity of\u00a0$$K_9$$"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,23]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1090\/S0002-9904-1962-10850-7","volume":"68","author":"J Battle","year":"1962","unstructured":"Battle, J., Harary, F., Kodama, Y.: Every planar graph with nine vertices has a nonplanar complement. Bull. Am. Math. Soc. 68, 569\u2013571 (1962)","journal-title":"Bull. Am. Math. Soc."},{"issue":"11","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0898-1221(97)00214-9","volume":"34","author":"L Beineke","year":"1997","unstructured":"Beineke, L.: Biplanar graphs: a survey. Comput. Math. Appl. 34(11), 1\u20138 (1997)","journal-title":"Comput. Math. Appl."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Czabarka, \u00c9., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Biplanar crossing numbers I: a survey of results and problems. In: More Sets, Graphs and Numbers, pp. 57\u201377 (2006)","DOI":"10.1007\/978-3-540-32439-3_4"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Czabarka, \u00c9., S\u00fdkora, O., Sz\u00e9kely, L.A., Vrt\u2019o, I.: Biplanar crossing numbers. II. comparing crossing numbers and biplanar crossing numbers using the probabilistic method. Random Struct. Algorithms 33(4), 480\u2013496 (2008)","DOI":"10.1002\/rsa.20221"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S1385-7258(54)50043-0","volume":"57","author":"GA Dirac","year":"1954","unstructured":"Dirac, G.A., Schuster, S.: A theorem of Kuratowski. Nederl. Akad. Wetensch. Proc. Ser. A 57, 343\u2013348 (1954)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A"},{"key":"7_CR6","unstructured":"Durocher, S., Gethner, E., Mondal, D.: On the biplanar crossing number of $${K}_n$$. In: Proceedings of the 28th Canadian Conference on Computational Geometry (CCCG), pp. 93\u2013100 (2016)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1090\/S0002-9904-1961-10677-0","volume":"67","author":"F Harary","year":"1961","unstructured":"Harary, F.: Problem 28. Bull. Am. Math. Soc. 67, 542 (1961)","journal-title":"Bull. Am. Math. Soc."},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Boston (1969)"},{"key":"7_CR9","unstructured":"Hearon, S.M.: Planar graphs, biplanar graphs and graph thickness. Master\u2019s thesis, California State University-San Bernardino (2016)"},{"issue":"6","key":"7_CR10","first-page":"19","volume":"4","author":"SK Kuila","year":"2014","unstructured":"Kuila, S.K.: Algebraic approach to prove non-coplanarity of $${K}_9$$. Int. J. Eng. Invent. 4(6), 19\u201323 (2014)","journal-title":"Int. J. Eng. Invent."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fundam. Math. 15, 271\u2013283 (1930)","journal-title":"Fundam. Math."},{"key":"7_CR12","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TCT.1971.1083266","volume":"18","author":"A Owens","year":"1971","unstructured":"Owens, A.: On the biplanar crossing number. IEEE Trans. Circuit Theory 18(2), 277\u2013280 (1971)","journal-title":"IEEE Trans. Circuit Theory"},{"key":"7_CR14","unstructured":"Shavali, A., Zarrabi-Zadeh, H.: New bounds on the biplanar and $$k$$-planar crossing numbers. arXiv: 1911.06403 (2019)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.4153\/CMB-1963-026-x","volume":"6","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: On non-biplanar character of the complete $$9$$-graph. Can. Math. Bull. 6, 319\u2013330 (1963)","journal-title":"Can. Math. Bull."}],"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-030-92931-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T01:01:50Z","timestamp":1766365310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92931-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030929305","9783030929312"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92931-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 December 2021","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":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo.inf.uni-tuebingen.de\/gd2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"74","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":"23","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":"5","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.02","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":"8.6","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}