{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:38:51Z","timestamp":1770068331346,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,16]],"date-time":"2015-06-16T00:00:00Z","timestamp":1434412800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00453-015-0016-8","type":"journal-article","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T10:10:50Z","timestamp":1434363050000},"page":"158-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Two-Page Book Embeddings of 4-Planar Graphs"],"prefix":"10.1007","volume":"75","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chrysanthi N.","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. Journal of Combinatorial Theory 27(3), 320\u2013331 (1979)","journal-title":"Journal of Combinatorial Theory"},{"issue":"1","key":"16_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1021998507140","volume":"7","author":"C Chen","year":"2003","unstructured":"Chen, C.: Any maximal planar graph with only one separating triangle is hamiltonian. J. Comb. Optim. 7(1), 79\u201386 (2003)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"16_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","volume":"10","author":"N Chiba","year":"1989","unstructured":"Chiba, N., Nishizeki, T.: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. J. Algorithms 10(2), 187\u2013211 (1989)","journal-title":"J. Algorithms"},{"issue":"1","key":"16_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebr. Discret. Methods 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"issue":"2","key":"16_CR5","first-page":"339","volume":"6","author":"V Dujmovic","year":"2004","unstructured":"Dujmovic, V., Wood, D.R.: On linear layouts of graphs. Discret. Math. Theor. Comput. Sci. 6(2), 339\u2013358 (2004)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Heath, L.S.: Embedding planar graphs in seven pages. In: Proceedings of the 25th IEEE Annual Symposium onFoundations of Computer Science, SFCS \u201984, pp. 74\u201383. IEEE Computer Society (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"key":"16_CR7","unstructured":"Heath, L.S.: Algorithms for Embedding Graphs in Books. PhD thesis, University of North Carolina, Chapel Hill (1985)"},{"issue":"14","key":"16_CR8","doi-asserted-by":"crossref","first-page":"1833","DOI":"10.1016\/j.dam.2007.03.018","volume":"155","author":"G Helden","year":"2007","unstructured":"Helden, G.: Each maximal planar graph with exactly two separating triangles is hamiltonian. Discret. Appl. Math. 155(14), 1833\u20131836 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"16_CR9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.aml.2006.08.019","volume":"20","author":"PC Kainen","year":"2007","unstructured":"Kainen, P.C., Overbay, S.: Extension of a theorem of Whitney. Appl. Math. Lett. 20(7), 835\u2013837 (2007)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"16_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<341::AID-JGT6>3.0.CO;2-O","volume":"24","author":"DP Sanders","year":"1997","unstructured":"Sanders, D.P.: On paths in planar graphs. J. Graph Theory 24(4), 341\u2013345 (1997)","journal-title":"J. Graph Theory"},{"issue":"1","key":"16_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","volume":"82","author":"WT Tutte","year":"1956","unstructured":"Tutte, W.T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82(1), 99\u2013116 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"16_CR12","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H Whitney","year":"1931","unstructured":"Whitney, H.: A theorem on graphs. Ann. Math. 32(2), 378\u2013390 (1931)","journal-title":"Ann. Math."},{"key":"16_CR13","unstructured":"Wigderson, A.: The complexity of the hamiltonian circuit problem for maximal planar graphs. Technical Report TR-298, EECS Department, Princeton University (1982)"},{"issue":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0016-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0016-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0016-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:21Z","timestamp":1559072841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0016-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,16]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["16"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0016-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,16]]}}}