{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T07:14:05Z","timestamp":1777446845463,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"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":[[1990,6]]},"DOI":"10.1016\/0012-365x(90)90209-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"323-326","source":"Crossref","is-referenced-by-count":7,"title":["A note on packing trees into complete bipartite graphs and on fishburn's conjecture"],"prefix":"10.1016","volume":"82","author":[{"given":"Y.","family":"Caro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Rodity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90209-Z_BIB1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(83)90254-6","article-title":"Some remarks on packing trees","volume":"46","author":"Bollob\u00e1s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90209-Z_BIB2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/jgt.3190070309","article-title":"Packing graphs with odd and even trees","volume":"7","author":"Fishburn","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(90)90209-Z_BIB3","first-page":"463","article-title":"Packing trees of different order into Kn","volume":"18","author":"Gyarfas","year":"1978","journal-title":"Coll. Math. Soc. J. Bolyai"},{"issue":"1","key":"10.1016\/0012-365X(90)90209-Z_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0012-365X(87)90164-6","article-title":"Packing trees in complete graphs","volume":"67","author":"Hobbs","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(90)90209-Z_BIB5","first-page":"156","author":"Yap","year":"1986"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090209Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9090209Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:23Z","timestamp":1555129523000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9090209Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0012365X9090209Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90209-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}