{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:35:17Z","timestamp":1649086517908},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0012-365x(03)00131-6","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"299-309","source":"Crossref","is-referenced-by-count":0,"title":["Bandwidth of the composition of two graphs"],"prefix":"10.1016","volume":"270","author":[{"given":"Toru","family":"Kojima","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00131-6_BIB1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/0602041","article-title":"The bandwidth of caterpillars with hairs of length 1 and 2","volume":"2","author":"Assmann","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(03)00131-6_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices\u2014a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00131-6_BIB3","first-page":"167","article-title":"Bandwidth of the composition of certain graph powers","volume":"39","author":"Chinn","year":"1995","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB4","first-page":"151","article-title":"Labelings of graphs","volume":"Vol. 3","author":"Chung","year":"1988"},{"key":"10.1016\/S0012-365X(03)00131-6_BIB5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(03)00131-6_BIB7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0012-365X(98)00009-0","article-title":"Bandwidth and density for block graphs","volume":"189","author":"Hung","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB8","first-page":"149","article-title":"Bandwidth for the sum of k graphs","volume":"37","author":"Lai","year":"1994","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S","article-title":"A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs","volume":"31","author":"Lai","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00131-6_BIB10","first-page":"251","article-title":"On the boundary inequality for bandwidth of graphs","volume":"42","author":"Li","year":"1996","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(94)00013-9","article-title":"On bandwidth and edgesum for the composition of two graphs","volume":"143","author":"Liu","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","article-title":"The NP-completeness of the bandwidth minimization problem","volume":"16","author":"Papadimitriou","year":"1976","journal-title":"Computing"},{"key":"10.1016\/S0012-365X(03)00131-6_BIB13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(93)E0219-T","article-title":"Bandwidth of the complete k-ary tree","volume":"142","author":"Smithline","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB14","first-page":"281","article-title":"The bandwidth problem","volume":"16","author":"Sys\u0142o","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00131-6_BIB15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(97)00040-X","article-title":"Harper-type lower bounds and the bandwidths of the compositions of graphs","volume":"181","author":"Zhou","year":"1998","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001316?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001316?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:26:07Z","timestamp":1553073967000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0012365X03001316"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00131-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}