{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T13:11:51Z","timestamp":1752671511112,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T00:00:00Z","timestamp":1533772800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (B) 16H03952","Grant-in-Aid for Young Scientists (B) 26800085"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (B) 16H03952","Grant-in-Aid for Young Scientists (B) 26800085"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (C) 16K05250","Grant-in-Aid for Scientific Research (C) 17K05349"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (C) 16K05250","Grant-in-Aid for Scientific Research (C) 17K05349"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s00373-018-1932-6","type":"journal-article","created":{"date-parts":[[2018,8,9]],"date-time":"2018-08-09T07:48:20Z","timestamp":1533800900000},"page":"1089-1099","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Matching Extendability of Optimal 1-Planar Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Jun","family":"Fujisawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keita","family":"Segawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"1932_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jctb.2007.06.001","volume":"98","author":"REL Aldred","year":"2008","unstructured":"Aldred, R.E.L., Kawarabayashi, K., Plummer, M.D.: On the matching extendability of graphs in surfaces. J. Comb. Theory Ser. B 98, 105\u2013115 (2008)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1932_CR2","first-page":"215","volume":"29","author":"REL Aldred","year":"2004","unstructured":"Aldred, R.E.L., Plummer, M.D.: Edge proximity and matching extension in planar triangulations. Australas. J. Comb. 29, 215\u2013224 (2004)","journal-title":"Australas. J. Comb."},{"key":"1932_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/jgt.20511","volume":"67","author":"REL Aldred","year":"2011","unstructured":"Aldred, R.E.L., Plummer, M.D.: Proximity thresholds for matching extension in planar and projective planar triangulations. J. Graph Theory 67, 38\u201346 (2011)","journal-title":"J. Graph Theory"},{"key":"1932_CR4","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1007\/s00453-015-0002-1","volume":"74","author":"C Auer","year":"2016","unstructured":"Auer, C., Bachmaier, C., Brandenburg, F.J., Glei\u00dfner, A., Hanauer, K., Neuwirth, D., Reislhuber, J.: Outer 1-planar graphs. Algorithmica 74, 1293\u20131320 (2016)","journal-title":"Algorithmica"},{"key":"1932_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00453-004-1134-x","volume":"43","author":"Z-Z Chen","year":"2005","unstructured":"Chen, Z.-Z., Kouno, M.: A linear-time algorithm for 7-coloring 1-plane graphs. Algorithmica 43, 147\u2013177 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"1932_CR6","doi-asserted-by":"crossref","first-page":"54","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), 54 (2013)","journal-title":"Electron. J. Combin."},{"key":"1932_CR7","volume-title":"Graph Theory. Graduate Texts in Mathematics, vol. 173","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2010)","edition":"4"},{"key":"1932_CR8","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, 854\u2013865 (2007)","journal-title":"Discrete Math."},{"key":"1932_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.jctb.2011.02.001","volume":"101","author":"K Kawarabayashi","year":"2011","unstructured":"Kawarabayashi, K., Negami, S., Plummer, M.D., Suzuki, Y.: The 2-extendability of 5-connected graphs on surfaces with large representativity. J. Comb. Theory Ser. B 101, 206\u2013213 (2011)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1932_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"VP Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72, 30\u201371 (2013)","journal-title":"J. Graph Theory"},{"key":"1932_CR11","doi-asserted-by":"publisher","first-page":"1965","DOI":"10.1007\/s00373-015-1568-8","volume":"31","author":"K Noguchi","year":"2015","unstructured":"Noguchi, K., Suzuki, Y.: Relationship among triangulations, quadrangulations and optimal 1-planar graphs. Graphs Comb. 31, 1965\u20131972 (2015)","journal-title":"Graphs Comb."},{"key":"1932_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0167-5060(08)70473-4","volume":"41","author":"MD Plummer","year":"1989","unstructured":"Plummer, M.D.: A theorem on matchings in the plane. Ann. Discrete Math. 41, 347\u2013354 (1989)","journal-title":"Ann. Discrete Math."},{"key":"1932_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(92)90292-N","volume":"109","author":"MD Plummer","year":"1992","unstructured":"Plummer, M.D.: Extending matchings in planar graphs IV. Discrete Math. 109, 207\u2013219 (1992)","journal-title":"Discrete Math."},{"key":"1932_CR14","first-page":"427","volume-title":"Recent Progress in Matching Extension, Building Bridges. Bolyai Society Mathematical Studies, vol. 19","author":"MD Plummer","year":"2008","unstructured":"Plummer, M.D.: Recent Progress in Matching Extension, Building Bridges. Bolyai Society Mathematical Studies, vol. 19, pp. 427\u2013454. Springer, Berlin (2008)"},{"key":"1932_CR15","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. Semin. Univ. Hamburg 29, 107\u2013117 (1965)","journal-title":"Abh. Semin. Univ. Hamburg"},{"key":"1932_CR16","doi-asserted-by":"publisher","first-page":"1527","DOI":"10.1137\/090746835","volume":"24","author":"Y Suzuki","year":"2010","unstructured":"Suzuki, Y.: Re-embeddings of maximum 1-planar graphs. SIAM J. Discrete Math. 24, 1527\u20131540 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"1932_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1006\/jctb.1994.1058","volume":"62","author":"R Thomas","year":"1994","unstructured":"Thomas, R., Yu, X.: 4-connected projective-planar graphs are Hamiltonian. J. Comb. Theory Ser. B 62, 114\u2013132 (1994)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1932-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1932-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1932-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:55:13Z","timestamp":1589446513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1932-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,9]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1932"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1932-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,8,9]]},"assertion":[{"value":"7 February 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}