{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:59Z","timestamp":1761620759724},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0166-218x(00)00178-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:49:17Z","timestamp":1027612157000},"page":"215-221","source":"Crossref","is-referenced-by-count":34,"title":["The pagenumber of k-trees is O(k)"],"prefix":"10.1016","volume":"109","author":[{"given":"Joseph","family":"L. Ganley","sequence":"first","affiliation":[]},{"given":"Lenwood","family":"S. Heath","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00178-5_BIB1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","article-title":"The book thickness of a graph","volume":"27","author":"Bernhart","year":"1979","journal-title":"J. Combina. Theory B"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB2","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0166-218X(00)00178-5_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded treewidth","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00178-5_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","article-title":"Embedding graphs in books: a layout problem with applications to VLSI design","volume":"8","author":"Chung","year":"1987","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/S0166-218X(00)00178-5_BIB5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combina. Theory B"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB6","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/0221055","article-title":"Laying out graphs using queues","volume":"21","author":"Heath","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00178-5_BIB7","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/jgt.3190120403","article-title":"Pagenumber of complete bipartite graphs","volume":"12","author":"Muder","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB8","unstructured":"S.V. Pemmaraju, Exploring the Powers of Stacks and Queues via Graph Layouts, Ph.D. Thesis, Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 1992."},{"key":"10.1016\/S0166-218X(00)00178-5_BIB9","doi-asserted-by":"crossref","unstructured":"S. Rengarajan, C.E.V. Madhavan, Stack and queue number of 2-trees. In: Proceedings of the First International Computing and Combinatorics Conference, Vol. 959, Lecture Notes in Computer Science, 1995, Springer, Berlin, pp. 203\u2013212.","DOI":"10.1007\/BFb0030834"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors III: planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combina. Theory B"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II: algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(95)00079-R","article-title":"The pagenumber of the class of bandwidth-k graphs is k\u22121","volume":"55","author":"Swaminathan","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00178-5_BIB13","series-title":"Linear algorithms on k-terminal graphs, Ph.D. Thesis, Department of Computer Science","author":"Wimer","year":"1987"},{"key":"10.1016\/S0166-218X(00)00178-5_BIB14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","article-title":"Embedding planar graphs in four pages","volume":"38","author":"Yannakakis","year":"1989","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001785?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001785?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T02:20:13Z","timestamp":1555899613000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0166218X00001785"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00178-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}