{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:55:40Z","timestamp":1648986940187},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":5191,"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":[[1999,5]]},"DOI":"10.1016\/s0012-365x(99)00028-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"291-297","source":"Crossref","is-referenced-by-count":0,"title":["Optimal factorizations of families of trees"],"prefix":"10.1016","volume":"203","author":[{"given":"Raphael","family":"Yuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00028-X_BIB1","unstructured":"N. Alon, J.H. Spencer, The Probabilistic Method, Wiley, New York, 1991."},{"key":"10.1016\/S0012-365X(99)00028-X_BIB2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jctb.1996.0020","article-title":"H-factors in dense graphs","volume":"66","author":"Alon","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(99)00028-X_BIB3","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Extremal Graph Theory, Academic Press, New York, 1978.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"10.1016\/S0012-365X(99)00028-X_BIB4","first-page":"1","article-title":"Packings of graphs and applications to computational complexity","volume":"24","author":"Bollob\u00e1s","year":"1978","journal-title":"J. Combin. Theory Ser B"},{"key":"10.1016\/S0012-365X(99)00028-X_BIB5","doi-asserted-by":"crossref","unstructured":"C.J. Colbourn, J.H. Dinitz, CRC Handbook of Combinatorial Design, CRC press, Boca Raton, 1996.","DOI":"10.1201\/9781420049954"},{"key":"10.1016\/S0012-365X(99)00028-X_BIB6","unstructured":"A. Gy\u00e1rf\u00e1s, J. Lehel, Packing trees of different order into Kn, Coll. Math. Soc. J. Bolyai 18 Combinatorics (1978) 463\u2013469."},{"key":"10.1016\/S0012-365X(99)00028-X_BIB7","doi-asserted-by":"crossref","unstructured":"N. Sauer, J. Spencer, Edge-disjoint placement of graphs, J. Combin. Theory, Ser B 25 (1979).","DOI":"10.1016\/0095-8956(78)90005-9"},{"key":"10.1016\/S0012-365X(99)00028-X_BIB8","unstructured":"E. Szemer\u00e9di, Regular partitions of graphs, in: J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau (Eds.), Proceedings of the Colloque International CNRS, 1978, pp. 399\u2013401."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9900028X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9900028X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:50:07Z","timestamp":1579020607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9900028X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0012365X9900028X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00028-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}