{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:13:00Z","timestamp":1777547580332,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":6713,"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":[[1995,3]]},"DOI":"10.1016\/0012-365x(94)00208-z","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"261-265","source":"Crossref","is-referenced-by-count":15,"title":["On the bandwidth of triangulated triangles"],"prefix":"10.1016","volume":"138","author":[{"given":"Robert","family":"Hochberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"McDiarmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00208-Z_BIB1","series-title":"Graph Theory With Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(94)00208-Z_BIB2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(75)90039-4","article-title":"Optimal labelling of a product of two paths","volume":"11","author":"Chv\u00e1talov\u00e1","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00208-Z_BIB3","series-title":"Graph Theoretic Concepts in Computer Science: Proc. 12th Internat. Workshop","article-title":"The bandwidth of planar distributive lattices","author":"Faigle","year":"1990"},{"key":"10.1016\/0012-365X(94)00208-Z_BIB4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","author":"Harper","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(94)00208-Z_BIB5","series-title":"Combinatorica, to appear. (Preliminary version: Decomposing graphs into regions of small diameter","first-page":"320","article-title":"Low diameter graph decompositions","author":"Linial","year":"1991"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400208Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400208Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:21:38Z","timestamp":1556115698000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400208Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0012365X9400208Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00208-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}