{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:56:11Z","timestamp":1648842971911},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0012-365x(96)00060-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"265-274","source":"Crossref","is-referenced-by-count":0,"title":["A note on packing of three forests"],"prefix":"10.1016","volume":"164","author":[{"given":"Jean-Fran\u00e7ois","family":"Sacl\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz","family":"Wo\u017aniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00060-X_BIB1","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0012-365X(96)00060-X_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/jgt.3190010308","article-title":"Every (p, p \u2212 2) graph is contained in its complement","volume":"1","author":"Burns","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00060-X_BIB3","first-page":"463","article-title":"Packing trees of different order into Kn","volume":"18","author":"Gy\u00e1rf\u00e1s","year":"1976","journal-title":"Colloq. Math. Soc. J. Bolyai"},{"key":"10.1016\/S0012-365X(96)00060-X_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\/S0012-365X(96)00060-X_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\/S0012-365X(96)00060-X_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\/S0012-365X(96)00060-X_BIB7","doi-asserted-by":"crossref","unstructured":"M. Mah\u00e9o, J.-F. Sacl\u00e9 and M. Wo\u017aniak, Edge-disjoint placement of three trees, European J. Combin., to appear.","DOI":"10.1006\/eujc.1996.0047"},{"key":"10.1016\/S0012-365X(96)00060-X_BIB8","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\/S0012-365X(96)00060-X_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/eujc.1993.1018","article-title":"Packing three copies of a tree into a complete graph","volume":"14","author":"Wang","year":"1993","journal-title":"Eurpoean J. Combin."},{"key":"10.1016\/S0012-365X(96)00060-X_BIB10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(95)00204-A","article-title":"Packing three trees","volume":"150","author":"Wo\u017aniak","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00060-X_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\/S0012-365X(96)00060-X_BIB12","article-title":"Some Topics in Graph Theory","volume":"108","author":"Yap","year":"1986"},{"key":"10.1016\/S0012-365X(96)00060-X_BIB13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0012-365X(88)90232-4","article-title":"Packing of graphs - 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:S0012365X9600060X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600060X?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:26:49Z","timestamp":1556116009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600060X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X9600060X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00060-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}