{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T13:47:33Z","timestamp":1749649653418},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_17","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"185-195","source":"Crossref","is-referenced-by-count":5,"title":["Block Additivity of \u21242-Embeddings"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Schaefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02773426","volume":"73","author":"K.S. Sarkaria","year":"1991","unstructured":"Sarkaria, K.S.: A one-dimensional Whitney trick and Kuratowski\u2019s graph planarity criterion. Israel J. Math.\u00a073(1), 79\u201389 (1991)","journal-title":"Israel J. Math."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.4064\/fm-23-1-135-142","volume":"23","author":"Chojnacki (Haim Hanani)","year":"1934","unstructured":"Chojnacki (Haim\u00a0Hanani), C.: \u00dcber wesentlich unpl\u00e4ttbare Kurven im drei-dimensionalen Raume. Fundamenta Mathematicae 23, 135\u2013142 (1934)","journal-title":"Fundamenta Mathematicae"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1137\/08072485X","volume":"23","author":"M.J. Pelsmajer","year":"2009","unstructured":"Pelsmajer, M.J., Schaefer, M., Stasi, D.: Strong Hanani\u2013Tutte on the projective plane. SIAM Journal on Discrete Mathematics\u00a023(3), 1317\u20131323 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR4","series-title":"Johns Hopkins Studies in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on surfaces. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (2001)"},{"unstructured":"Levow, R.B.: On Tutte\u2019s algebraic approach to the theory of crossing numbers. In: Hoffman, F., Levow, R.B., Thomas, R.S.D. (eds.) Proceedings of the Third Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Fla., Florida Atlantic University, pp. 315\u2013314 (1972)","key":"17_CR5"},{"key":"17_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4372-4","volume-title":"Classical topology and combinatorial group theory. Second edn","author":"J. Stillwell","year":"1993","unstructured":"Stillwell, J.: Classical topology and combinatorial group theory. Second edn, 2nd edn. Graduate Texts in Mathematics, vol.\u00a072. Springer, New York (1993)","edition":"2"},{"key":"17_CR7","volume-title":"Universitext","author":"M. Longueville de","year":"2013","unstructured":"de Longueville, M.: A course in topological combinatorics. In: Universitext, Springer, New York (2013)"},{"unstructured":"Babai, L., Frankl, P.: Linear algebra methods in combinatorics with applications to geometry and computer science. Department of Computer Science, The University of Chicago (1992)","key":"17_CR8"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","volume":"10","author":"C. Thomassen","year":"1989","unstructured":"Thomassen, C.: The graph genus problem is NP-complete. J. Algorithms\u00a010(4), 568\u2013576 (1989)","journal-title":"J. Algorithms"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1137\/S089548019529248X","volume":"12","author":"B. Mohar","year":"1999","unstructured":"Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM J. Discrete Math.\u00a012(1), 6\u201326 (1999)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T15:42:17Z","timestamp":1688830937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}