{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:58:47Z","timestamp":1710244727640},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T00:00:00Z","timestamp":1259280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11786-009-0012-y","type":"journal-article","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T16:28:50Z","timestamp":1259339330000},"page":"109-117","source":"Crossref","is-referenced-by-count":4,"title":["On the Pagenumber of the Cube-Connected Cycles"],"prefix":"10.1007","volume":"3","author":[{"given":"Yuuki","family":"Tanaka","sequence":"first","affiliation":[]},{"given":"Yukio","family":"Shibata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,27]]},"reference":[{"key":"12_CR1","volume-title":"Graphs & Digraphs","author":"G. Chartrand","year":"2004","unstructured":"Chartrand G., Lesniak L.: Graphs & Digraphs, 4 edn. Chapman & Hall\/CRC, Boca Raton (2004)","edition":"4"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F.R.K. Chung","year":"1987","unstructured":"Chung F.R.K., Leighton F.T., Rosenberg A.L.: Embedding graphs in books: a layout problem with application to VLSI design. SIAM J. Algebraic Discret. Methods 8, 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discret. Methods"},{"key":"12_CR3","doi-asserted-by":"crossref","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. Discret. Math. Theor. Comput. Sci. 7, 155\u2013202 (2005)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"2","key":"12_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/net.10032","volume":"40","author":"T. Hasunuma","year":"2002","unstructured":"Hasunuma T.: Embedding iterated line digraphs in books. Networks 40(2), 51\u201362 (2002)","journal-title":"Networks"},{"key":"12_CR5","unstructured":"Konoe, M., Hagiwara, K. Tokura, N.: On the pagenumber of hypercubes and cube-connected cycles. IEICE Trans. J71-D(3), 490\u2013500 (1988) (in Japanese)"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/jgt.3190120403","volume":"12","author":"D.J. Muder","year":"1988","unstructured":"Muder D.J., Weaver M.L., West D.B.: Pagenumber of complete bipartite graphs. J. Graph Theory 12, 469\u2013489 (1988)","journal-title":"J. Graph Theory"},{"issue":"5","key":"12_CR7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"Preparata F.P., Vuillemin J.: The cube-connected cycles: a versatile network for parallel computation. Commun. ACM 24(5), 300\u2013309 (1981)","journal-title":"Commun. ACM"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1016\/j.dam.2006.01.001","volume":"154","author":"Y. Tanaka","year":"2006","unstructured":"Tanaka Y., Shibata Y.: On the pagenumber of trivalent Cayley graphs. Discret. Appl. Math. 154, 1279\u20131292 (2006)","journal-title":"Discret. Appl. Math."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Four pages are necessary and sufficient for planar graphs. In: Proceedings of 18th ACM symposium on theory of computing, pp.104\u2013108 (1986)","DOI":"10.1145\/12130.12141"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0012-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-009-0012-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0012-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T21:40:24Z","timestamp":1634247624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-009-0012-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,27]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1007\/s11786-009-0012-y","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,27]]}}}