{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:08:35Z","timestamp":1649009315546},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0166-218x(92)90040-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"163-166","source":"Crossref","is-referenced-by-count":0,"title":["On the tree packing problem"],"prefix":"10.1016","volume":"35","author":[{"given":"Shigeru","family":"Masuyama","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90040-H_BIB1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/322003.322005","article-title":"Covering the points of a digraph with point-disjoint paths and its application to code optimization","volume":"24","author":"Boesch","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90040-H_BIB2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","article-title":"Packing subgraphs in a graph","volume":"4","author":"Cornuejols","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(92)90040-H_BIB3","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(92)90040-H_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(81)90073-9","article-title":"On generalized matching problems","volume":"12","author":"Hell","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(92)90040-H_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(84)90150-X","article-title":"Packings by cliques and by finite families of graphs","volume":"49","author":"Hell","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90040-H_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/0607024","article-title":"Packings by complete biparite graphs","volume":"7","author":"Hell","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)90040-H_BIB7","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90040-H_BIB8","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(92)90040-H_BIB9","series-title":"Tech. Rept. #87014","article-title":"On the tree packing problem","author":"Masuyama","year":"1987"},{"key":"10.1016\/0166-218X(92)90040-H_BIB10","series-title":"Tech. Rept. #87001","article-title":"Computational complexity of chain packing problems","author":"Masuyama","year":"1987"},{"key":"10.1016\/0166-218X(92)90040-H_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0166-218X(92)90040-H_BIB12","first-page":"206","article-title":"Graph packing over a rooted tree","volume":"49","author":"Zhang","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290040H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290040H?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:51:03Z","timestamp":1555131063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290040H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0166218X9290040H"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90040-h","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}