{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:38:21Z","timestamp":1648658301925},"reference-count":13,"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(95)00204-a","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"393-402","source":"Crossref","is-referenced-by-count":2,"title":["Packing three trees"],"prefix":"10.1016","volume":"150","author":[{"given":"Mariusz","family":"Wo\u017aniak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00204-A_BIB1","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(95)00204-A_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/jgt.3190010308","article-title":"Every (p, p - 2) graph is contained in its complement","volume":"1","author":"Burns","year":"1977","journal-title":"J. Graph Theory"},{"issue":"106","key":"10.1016\/0012-365X(95)00204-A_BIB3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.21136\/CMJ.1981.101722","article-title":"Embedding graphs in their complements","volume":"31","author":"Faudree","year":"1981","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0012-365X(95)00204-A_BIB4","first-page":"149","article-title":"A note on packing two trees into Kn","volume":"11","author":"Hedetniemi","year":"1981","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(95)00204-A_BIB5","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(95)00204-A_BIB6","first-page":"26","article-title":"Decomposition of complete graphs into trees","volume":"5","author":"Huang","year":"1978","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(95)00204-A_BIB7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","article-title":"Edge disjoint placement of graphs","volume":"25","author":"Sauer","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(95)00204-A_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/eujc.1993.1018","article-title":"Packing three copies of a tree into complete graph","volume":"14","author":"Wang","year":"1993","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(95)00204-A_BIB9","first-page":"727","article-title":"A note on embedding graphs without small cycles","volume":"60","author":"Wo\u017aniak","year":"1991","journal-title":"Coll. Math. Soc. J. Bolyai"},{"key":"10.1016\/0012-365X(95)00204-A_BIB10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(94)90112-0","article-title":"Embedding graphs of small size","volume":"51","author":"Wo\u017aniak","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00204-A_BIB11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01195330","article-title":"Triple placement of graphs","volume":"9","author":"Wo\u017aniak","year":"1993","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(95)00204-A_BIB12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511662065","article-title":"Some Topics in Graph Theory","author":"Yap","year":"1986"},{"key":"10.1016\/0012-365X(95)00204-A_BIB13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0012-365X(88)90232-4","article-title":"Packing of graphs \u2014 a survey","volume":"72","author":"Yap","year":"1988","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500204A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500204A?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\/0012365X9500204A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0012365X9500204A"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00204-a","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}