{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:38:56Z","timestamp":1648597136119},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"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":10730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1984,3]]},"DOI":"10.1016\/0097-3165(84)90003-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"174-182","source":"Crossref","is-referenced-by-count":2,"title":["Packing sequences"],"prefix":"10.1016","volume":"36","author":[{"given":"Arthur M","family":"Hobbs","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(84)90003-7_BIB1","series-title":"Graphs and Digraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0097-3165(84)90003-7_BIB2","unstructured":"R. Graham, private communication, Bell Laboratories, Murray Hill, N.J."},{"key":"10.1016\/0097-3165(84)90003-7_BIB3","first-page":"463","article-title":"Packing trees of different order into Kn","volume":"Vol. I","author":"Gy\u00e1rf\u00e1s","year":"1978"},{"key":"10.1016\/0097-3165(84)90003-7_BIB4","unstructured":"A. M. Hobbs, Packing trees, in \u201cProceedings of the 12th Southeastern Conference on Combinatorics, Graph Theory, and Computing,\u201d Congressus Numerantium, Vol. 33, pp. 63\u201373."},{"key":"10.1016\/0097-3165(84)90003-7_BIB5","unstructured":"A. M. Hobbs, and J. Kasiraj, Packing trees. II. Trees of diameter three, submitted."},{"key":"10.1016\/0097-3165(84)90003-7_BIB6","series-title":"Topics in Graph Theory","first-page":"190","article-title":"Packing trees of different size into the complete graph","volume":"Vol. 328","author":"Straight","year":"1979"},{"key":"10.1016\/0097-3165(84)90003-7_BIB7","unstructured":"J. Zaks, private communication, Dept. Math., Univ. of Haifa, Haifa, Israel."},{"key":"10.1016\/0097-3165(84)90003-7_BIB8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0097-3165(83)90045-6","article-title":"Balanced integer arrays: A matrix packing theorem","volume":"34","author":"Fishburn","year":"1983","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316584900037?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316584900037?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:52:55Z","timestamp":1548751975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316584900037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["0097316584900037"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(84)90003-7","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}