{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:01Z","timestamp":1740107101495,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T00:00:00Z","timestamp":1618876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T00:00:00Z","timestamp":1618876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11301169"],"award-info":[{"award-number":["11301169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004761","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"crossref","award":["2017JJ2055"],"award-info":[{"award-number":["2017JJ2055"]}],"id":[{"id":"10.13039\/501100004761","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Scientific Research Fund of Hunan Provincial Education Department of China","award":["18A432"],"award-info":[{"award-number":["18A432"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s00373-021-02320-x","type":"journal-article","created":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T22:38:15Z","timestamp":1618958295000},"page":"1333-1344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Maximal 1-Planarity and Crossing Numbers of Graphs"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1559-8909","authenticated-orcid":false,"given":"Zhangdong","family":"Ouyang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanqiu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengming","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,20]]},"reference":[{"issue":"1","key":"2320_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.26493\/1855-3974.10.2d0","volume":"1","author":"MO Albertson","year":"2008","unstructured":"Albertson, M.O.: Chromatic number, independence ratio, and crossing number. ARS Math. Contemp. 1(1), 1\u20136 (2008)","journal-title":"ARS Math. Contemp."},{"key":"2320_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.dam.2017.08.015","volume":"232","author":"C Bachmaier","year":"2017","unstructured":"Bachmaier, C., Brandenburg, F.J., Hanauer, K., Neuwirth, D., Reislhuber, J.: NIC-planar graphs. Discrete Appl. Math. 232, 23\u201340 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"2320_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.22187","volume":"88","author":"J Bar\u00e1","year":"2018","unstructured":"Bar\u00e1, J., T\u00f3th, G.: Improvements on the density of maximal 1-planar graphs. J. Graph Theory 88(1), 101\u2013109 (2018)","journal-title":"J. Graph Theory"},{"key":"2320_CR4","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.dam.2020.10.004","volume":"289","author":"T Biedl","year":"2021","unstructured":"Biedl, T.: A note on 1-planar graphs with minimum degree 7. Discrete Appl. Math. 289, 230\u2013232 (2021)","journal-title":"Discrete Appl. Math."},{"key":"2320_CR5","volume-title":"Graph Theory (Graduate Texts in Mathematics)","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory (Graduate Texts in Mathematics). Springer, New York (2008)"},{"key":"2320_CR6","first-page":"327","volume-title":"On the Density of Maximal 1-Planar Graphs, International Symposium on Graph Drawing","author":"FJ Brandenburg","year":"2012","unstructured":"Brandenburg, F.J., Eppstein, D., Glei\u00dfner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.: On the Density of Maximal 1-Planar Graphs, International Symposium on Graph Drawing, pp. 327\u2013338. Springer, Berlin, Heidelberg (2012)"},{"issue":"2","key":"2320_CR7","doi-asserted-by":"publisher","first-page":"P54","DOI":"10.37236\/2392","volume":"20","author":"J Czap","year":"2013","unstructured":"Czap, J., Hud\u00e1k, D.: On drawings and decompositions of 1-planar graphs. Electron. J. Combin. 20(2), (2013)","journal-title":"Electron. J. Combin."},{"issue":"7","key":"2320_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Inf. Process. Lett. 113(7), 236\u2013240 (2013)","journal-title":"Inf. Process. Lett."},{"key":"2320_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2013.09.029","volume":"513","author":"P Eades","year":"2013","unstructured":"Eades, P., Hong, S.H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513, 65\u201376 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"7\u20138","key":"2320_CR10","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1016\/j.disc.2005.11.056","volume":"307","author":"I Fabrici","year":"2007","unstructured":"Fabrici, I., Madaras, T.: The structure of 1-planar graphs. Discrete Math. 307(7\u20138), 854\u2013865 (2007)","journal-title":"Discrete Math."},{"key":"2320_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"S G Kobourov","year":"2017","unstructured":"Kobourov, S. G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"2320_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"2320_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ. Hamburg 29, 107\u2013117 (1965)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"2320_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/mana.19861250122","volume":"125","author":"H Schumacher","year":"1986","unstructured":"Schumacher, H.: Zur struktur 1-planarer graphen. Math. Nachr. 125, 291\u2013300 (1986)","journal-title":"Math. Nachr."},{"key":"2320_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-981-15-6533-5_4","volume-title":"1-Planar Graphs, Beyond Planar Graphs","author":"Y Suzuki","year":"2020","unstructured":"Suzuki, Y.: 1-Planar Graphs, Beyond Planar Graphs, pp. 47\u201368. Springer, Singapore (2020)"},{"issue":"2","key":"2320_CR16","first-page":"308","volume":"11","author":"X Zhang","year":"2013","unstructured":"Zhang, X., Liu, G.: The structure of plane graphs with independent crossings and its application to coloring problems. Central Eur. J. Math. 11(2), 308\u2013321 (2013)","journal-title":"Central Eur. J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02320-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02320-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02320-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T07:09:56Z","timestamp":1625036996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02320-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,20]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["2320"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02320-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,4,20]]},"assertion":[{"value":"25 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}