{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:39:07Z","timestamp":1649155147945},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"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":6316,"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":[[1996,4]]},"DOI":"10.1016\/0012-365x(96)00205-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"403-406","source":"Crossref","is-referenced-by-count":5,"title":["The bandwidth of a tree with k leaves is at most [k2]"],"prefix":"10.1016","volume":"150","author":[{"given":"Kiyoshi","family":"Ando","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsusi","family":"Kaneko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Severino","family":"Gervacio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(96)00205-1_BIB1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices \u2014 a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(96)00205-1_BIB2","series-title":"Selected Topics in Graph Theory","first-page":"151","article-title":"labellings of Graphs","author":"Chung","year":"1988"},{"key":"10.1016\/0012-365X(96)00205-1_BIB3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.21136\/CMJ.1970.100949","article-title":"A remark on a problem of Harary","volume":"20","author":"Chv\u00e1tal","year":"1970","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0012-365X(96)00205-1_BIB4","article-title":"The bandwidth problem for graphs: a collection of recent results","author":"Chv\u00e1talov\u00e1","year":"1975"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X96002051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X96002051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,9]],"date-time":"2021-05-09T06:46:36Z","timestamp":1620542796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X96002051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X96002051"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(96)00205-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}