{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T13:30:33Z","timestamp":1748352633780,"version":"3.37.3"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:00:00Z","timestamp":1676678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:00:00Z","timestamp":1676678400000},"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":["Discrete Comput Geom"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00454-022-00478-6","type":"journal-article","created":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T05:03:41Z","timestamp":1676869421000},"page":"1210-1237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Three-Dimensional Graph Products with Unbounded Stack-Number"],"prefix":"10.1007","volume":"71","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Robert","family":"Hickingbotham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Laura","family":"Merker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Sergey","family":"Norin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Micha\u0142 T.","family":"Seweryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8866-3041","authenticated-orcid":false,"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,18]]},"reference":[{"key":"478_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.01.035","volume":"861","author":"JM Alam","year":"2021","unstructured":"Alam, J.M., Bekos, M.A., Dujmovi\u0107, V., Gronemann, M., Kaufmann, M., Pupyrev, S.: On dispersable book embeddings. Theoret. Comput. Sci. 861, 1\u201322 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"478_CR2","unstructured":"Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: On the book thickness of 1-planar graphs (2015). arXiv:1510.05891"},{"issue":"3\u20134","key":"478_CR3","first-page":"875","volume":"72","author":"G Ambrus","year":"2006","unstructured":"Ambrus, G., Bar\u00e1t, J., Hajnal, P.: The slope parameter of graphs. Acta Sci. Math. (Szeged) 72(3\u20134), 875\u2013889 (2006)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"478_CR4","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electron. J. Comb. 13, # R3 (2006)","DOI":"10.37236\/1029"},{"key":"478_CR5","doi-asserted-by":"crossref","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science (Bad Honnef 2004). Lecture Notes in Computer Science, vol. 3353, pp. 332\u2013343. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30559-0_28"},{"key":"478_CR6","unstructured":"Beame, P., Blais, E., Huynh-Ngoc, D.-T.: Longest common subsequences in sets of permutations (2009). arXiv:0904.1615"},{"issue":"2","key":"478_CR7","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00453-016-0203-2","volume":"79","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, Ch.N.: The book thickness of 1-planar graphs is constant. Algorithmica 79(2), 444\u2013465 (2017)","journal-title":"Algorithmica"},{"key":"478_CR8","unstructured":"Bekos, M.A., Da Lozzo, G., Griesbach, S.M., Gronemann, M., Montecchiani,\u00a0F., Raftopoulou, Ch.: Book embeddings of nonplanar graphs with small faces in few pages. In: 36th International Symposium on Computational Geometry. Leibniz International Proceedings in Informatics, vol. 164, # 16. Leibniz-Zent. Inform., Wadern (2020)"},{"issue":"1","key":"478_CR9","first-page":"332","volume":"11","author":"MA Bekos","year":"2020","unstructured":"Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, Ch., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11(1), 332\u2013353 (2020)","journal-title":"J. Comput. Geom."},{"issue":"3","key":"478_CR10","doi-asserted-by":"publisher","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. J. Comb. Theory Ser. B 27(3), 320\u2013331 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"key":"478_CR11","unstructured":"Bj\u00f6rner, A.: Topological methods. In: Handbook of Combinatorics, vol. 2, pp. 1819\u20131872. Elsevier, Amsterdam (1995)"},{"key":"478_CR12","unstructured":"Blankenship, R.L.: Book Embeddings of Graphs. PhD thesis, Louisiana State University and Agricultural & Mechanical College (2003)"},{"key":"478_CR13","unstructured":"Blankenship, R., Oporowski, B.: Drawing subdivisions of complete and complete bipartite graphs on books. Tech. Rep. 1999-4. Department of Mathematics, Louisiana State University (1999)"},{"issue":"7\u20138","key":"478_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.crma.2009.02.009","volume":"347","author":"J Bourgain","year":"2009","unstructured":"Bourgain, J.: Expanders and dimensional expansion. C. R. Math. Acad. Sci. Paris 347(7\u20138), 357\u2013362 (2009)","journal-title":"C. R. Math. Acad. Sci. Paris"},{"issue":"1","key":"478_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00039-012-0200-9","volume":"23","author":"J Bourgain","year":"2013","unstructured":"Bourgain, J., Yehudayoff, A.: Expansion in $${\\rm SL}_2(\\mathbb{R} )$$ and monotone expanders. Geom. Funct. Anal. 23(1), 1\u201341 (2013)","journal-title":"Geom. Funct. Anal."},{"key":"478_CR16","unstructured":"Brandenburg, F.J.: Book embeddings of $$k$$-map graphs (2020). arXiv:2012.06874"},{"key":"478_CR17","doi-asserted-by":"crossref","unstructured":"Buss, J.F., Shor, P.: On the pagenumber of planar graphs. In: 16th ACM Symposium on Theory of Computing (Washington 1984), pp. 98\u2013100. ACM, New York (1984)","DOI":"10.1145\/800057.808670"},{"key":"478_CR18","unstructured":"Camarena, O.A.: The van Kampen theorem (2021). https:\/\/www.matem.unam.mx\/omar\/groupoids\/vankampen.pdf"},{"issue":"1","key":"478_CR19","doi-asserted-by":"publisher","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. Discrete Methods 8(1), 33\u201358 (1987)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"3","key":"478_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00023","volume":"4","author":"MB Dillencourt","year":"2000","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms Appl. 4(3), 5\u201317 (2000)","journal-title":"J. Graph Algorithms Appl."},{"key":"478_CR21","doi-asserted-by":"crossref","unstructured":"\u0110okovi\u0107, D.\u017d., Golubitsky, O., Kotsireas, I.S.: Some new orders of Hadamard and skew-Hadamard matrices. J. Comb. Des. 22(6), 270\u2013277 (2014)","DOI":"10.1002\/jcd.21358"},{"issue":"2","key":"478_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00493-021-4585-7","volume":"42","author":"V Dujmovi\u0107","year":"2021","unstructured":"Dujmovi\u0107, V., Eppstein, D., Hickingbotham, R., Morin, P., Wood, D.R.: Stack-number is not bounded by queue-number. Combinatorica 42(2), 151\u2013164 (2021)","journal-title":"Combinatorica"},{"issue":"3","key":"478_CR23","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3), 194\u2013212 (2007)","journal-title":"Comput. Geom."},{"issue":"1","key":"478_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.7155\/jgaa.00549","volume":"25","author":"V Dujmovi\u0107","year":"2021","unstructured":"Dujmovi\u0107, V., Morin, P., Yelle, C.: Two results on layered pathwidth and linear layouts. J. Graph Algorithms Appl. 25(1), 43\u201357 (2021)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"478_CR25","first-page":"497","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 497\u2013521 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"478_CR26","unstructured":"Dujmovi\u0107, V., Sidiropoulos, A., Wood, D.R.: Layouts of expander graphs. Chic. J. Theoret. Comput. Sci. 2016, # 1 (2016)"},{"issue":"3","key":"478_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2006.08.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Comput. Geom. 38(3), 181\u2013193 (2007)","journal-title":"Comput. Geom."},{"key":"478_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.46298\/dmtcs.346","volume":"7","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7, 155\u2013201 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"478_CR29","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00454-007-1318-7","volume":"37","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Graph treewidth and geometric thickness parameters. Discrete Comput. Geom. 37(4), 641\u2013670 (2007)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"478_CR30","first-page":"39","volume":"13","author":"V Dujmovi\u0107","year":"2011","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On the book thickness of $$k$$-trees. Discrete Math. Theor. Comput. Sci. 13(3), 39\u201344 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1\u20133","key":"478_CR31","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00144-6","volume":"175","author":"T Endo","year":"1997","unstructured":"Endo, T.: The pagenumber of toroidal graphs is at most seven. Discrete Math. 175(1\u20133), 87\u201396 (1997)","journal-title":"Discrete Math."},{"key":"478_CR32","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Separating geometric thickness from book thickness (2001). arXiv:math\/0109195","DOI":"10.1007\/3-540-36151-0_15"},{"key":"478_CR33","unstructured":"Fedorov, E.S.: Introduction to the Theory of Figures. St, Petersburg (1885). (in Russian)"},{"issue":"1","key":"478_CR34","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02122679","volume":"9","author":"Z Galil","year":"1989","unstructured":"Galil, Z., Kannan, R., Szemer\u00e9di, E.: On $$3$$-pushdown graphs with large separators. Combinatorica 9(1), 9\u201319 (1989)","journal-title":"Combinatorica"},{"issue":"3","key":"478_CR35","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(00)00178-5","volume":"109","author":"JL Ganley","year":"2001","unstructured":"Ganley, J.L., Heath, L.S.: The pagenumber of $$k$$-trees is $$O(k)$$. Discrete Appl. Math. 109(3), 215\u2013221 (2001)","journal-title":"Discrete Appl. Math."},{"key":"478_CR36","doi-asserted-by":"crossref","unstructured":"Gromov, M.: Singularities, expanders and topology of maps. Part\u00a02: from combinatorics to topology via algebraic isoperimetry. Geom. Funct. Anal. 20(2), 416\u2013526 (2010)","DOI":"10.1007\/s00039-010-0073-8"},{"issue":"1\u20133","key":"478_CR37","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0012-365X(94)00313-8","volume":"149","author":"SL Hakimi","year":"1996","unstructured":"Hakimi, S.L., Mitchem, J., Schmeichel, E.: Star arboricity of graphs. Discrete Math. 149(1\u20133), 93\u201398 (1996)","journal-title":"Discrete Math."},{"issue":"3","key":"478_CR38","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1006\/bulm.1998.0085","volume":"61","author":"Ch Haslinger","year":"1999","unstructured":"Haslinger, Ch., Stadler, P.F.: RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties. Bull. Math. Biol. 61(3), 437\u2013467 (1999)","journal-title":"Bull. Math. Biol."},{"key":"478_CR39","volume-title":"Algebraic Topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"issue":"2","key":"478_CR40","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0095-8956(03)00031-5","volume":"88","author":"P Haxell","year":"2003","unstructured":"Haxell, P., Szab\u00f3, T., Tardos, G.: Bounded size components\u2014partitions and transversals. J. Comb. Theory Ser. B 88(2), 281\u2013297 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"478_CR41","doi-asserted-by":"crossref","unstructured":"Heath, L.S.: Embedding planar graphs in seven pages. In: 25th Annual Symposium on Foundations of Computer Sciences (Singer Island 1984), pp. 74\u201383. IEEE (1984)","DOI":"10.1109\/SFCS.1984.715903"},{"issue":"3","key":"478_CR42","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/146637.146643","volume":"39","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Istrail, S.: The pagenumber of genus $$g$$ graphs is $$O(g)$$. J. Assoc. Comput. Mach. 39(3), 479\u2013501 (1992)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"478_CR43","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"LS Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"478_CR44","unstructured":"Hickingbotham, R., Wood, D.R.: Shallow minors, graph products and beyond planar graphs (2021). arXiv:2111.12412"},{"key":"478_CR45","first-page":"127","volume":"71","author":"PC Kainen","year":"1990","unstructured":"Kainen, P.C.: The book thickness of a graph II. Congr. Numer. 71, 127\u2013132 (1990)","journal-title":"Congr. Numer."},{"issue":"2","key":"478_CR46","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.comgeo.2007.05.003","volume":"40","author":"B Keszegh","year":"2008","unstructured":"Keszegh, B., Pach, J., P\u00e1lv\u00f6lgyi, D., T\u00f3th, G.: Drawing cubic graphs with at most five slopes. Comput. Geom. 40(2), 138\u2013147 (2008)","journal-title":"Comput. Geom."},{"issue":"5","key":"478_CR47","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00493-007-2183-y","volume":"27","author":"R Krauthgamer","year":"2007","unstructured":"Krauthgamer, R., Lee, J.R.: The intrinsic dimensionality of graphs. Combinatorica 27(5), 551\u2013585 (2007)","journal-title":"Combinatorica"},{"issue":"1","key":"478_CR48","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jagm.1994.1027","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Graphs with $$E$$ edges have pagenumber $$O(\\sqrt{E})$$. J. Algorithms 17(1), 71\u201384 (1994)","journal-title":"J. Algorithms"},{"issue":"1","key":"478_CR49","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.1994.1028","volume":"17","author":"SM Malitz","year":"1994","unstructured":"Malitz, S.M.: Genus $$g$$ graphs have pagenumber $$O(\\sqrt{g})$$. J. Algorithms 17(1), 85\u2013109 (1994)","journal-title":"J. Algorithms"},{"key":"478_CR50","first-page":"459","volume":"8","author":"LT Ollmann","year":"1973","unstructured":"Ollmann, L.T.: On the book thicknesses of various graphs. Congr. Numer. 8, 459 (1973)","journal-title":"Congr. Numer."},{"key":"478_CR51","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electron. J. Comb. 13, # N1 (2006)","DOI":"10.37236\/1139"},{"key":"478_CR52","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/sapm1933121311","volume":"12","author":"REAC Paley","year":"1933","unstructured":"Paley, R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12, 311\u2013320 (1933)","journal-title":"J. Math. Phys."},{"key":"478_CR53","unstructured":"Pemmaraju, S.V.: Exploring the Powers of Stacks and Queues via Graph Layouts. PhD thesis, Virginia Polytechnic Institute and State University (1992)"},{"key":"478_CR54","unstructured":"Pupyrev, S.: Book embeddings of graph products (2020). arXiv:2007.15102"},{"issue":"10","key":"478_CR55","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"32","author":"AL Rosenberg","year":"1983","unstructured":"Rosenberg, A.L.: The DIOGENES approach to testable fault-tolerant arrays of processors. IEEE Trans. Comput. 32(10), 902\u2013910 (1983)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"478_CR56","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<413::AID-JGT7>3.0.CO;2-S","volume":"21","author":"F Shahrokhi","year":"1996","unstructured":"Shahrokhi, F., Sz\u00e9kely, L.A., S\u00fdkora, O., Vrt\u2019o, I.: The book crossing number of a graph. J. Graph Theory 21(4), 413\u2013424 (1996)","journal-title":"J. Graph Theory"},{"key":"478_CR57","doi-asserted-by":"crossref","unstructured":"Sylvester, J.J.: Thoughts on inverse orthogonal matrices, simultaneous sign-successions, and tessellated pavements in two or more colours, with applications to Newton\u2019s rule, ornamental tile-work, and the theory of numbers. Lond. Edinb. Dublin Philos. Mag. J. Sci. 34(232), 461\u2013475 (1867)","DOI":"10.1080\/14786446708639914"},{"issue":"3","key":"478_CR58","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1137\/080714208","volume":"23","author":"J Vandenbussche","year":"2009","unstructured":"Vandenbussche, J., West, D.B., Yu, G.: On the pagenumber of $$k$$-trees. SIAM J. Discrete Math. 23(3), 1455\u20131464 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"478_CR59","doi-asserted-by":"crossref","unstructured":"Wood, D.R.: Bounded degree book embeddings and three-dimensional orthogonal graph drawing. In: 9th International Symposium on Graph Drawing (Vienna 2001). Lecture Notes in Computer Science, vol. 2265, pp. 312\u2013327. Springer, Berlin (2002)","DOI":"10.1007\/3-540-45848-4_25"},{"issue":"1","key":"478_CR60","first-page":"255","volume":"7","author":"DR Wood","year":"2005","unstructured":"Wood, D.R.: Queue layouts of graph products and powers. Discrete Math. Theor. Comput. Sci. 7(1), 255\u2013268 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"478_CR61","doi-asserted-by":"crossref","unstructured":"Wood, D.R.: Defective and clustered graph colouring. Electron. J. Comb. DS, # 23 (2018)","DOI":"10.37236\/7406"},{"issue":"1","key":"478_CR62","doi-asserted-by":"publisher","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. System Sci. 38(1), 36\u201367 (1989)","journal-title":"J. Comput. System Sci."},{"key":"478_CR63","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jctb.2020.05.008","volume":"145","author":"M Yannakakis","year":"2020","unstructured":"Yannakakis, M.: Planar graphs that need four pages. J. Comb. Theory Ser. B 145, 241\u2013263 (2020)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00478-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-022-00478-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00478-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T16:56:02Z","timestamp":1728924962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-022-00478-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,18]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["478"],"URL":"https:\/\/doi.org\/10.1007\/s00454-022-00478-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2023,2,18]]},"assertion":[{"value":"10 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}