{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:21:18Z","timestamp":1648923678062},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"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":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00108-0","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"195-205","source":"Crossref","is-referenced-by-count":0,"title":["Minimum degree and minimum number of edge-disjoint trees"],"prefix":"10.1016","volume":"275","author":[{"given":"A.","family":"Llad\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.C.","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00108-0_BIB1","series-title":"Graph Theory","author":"B\u00f3llobas","year":"1979"},{"key":"10.1016\/S0012-365X(03)00108-0_BIB2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(78)90183-8","article-title":"On partition of graphs into trees","volume":"23","author":"Chung","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00108-0_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(99)00314-3","article-title":"Higher edge connectivities and tree decompositions in regular graphs","volume":"214","author":"Guti\u00e9rrez","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00108-0_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0012-365X(76)90065-0","article-title":"Orienting planar graphs","volume":"14","author":"Kempen","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00108-0_BIB5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/S0012-365X(96)00193-8","article-title":"On the tree number of regular graphs","volume":"165\/166","author":"Llad\u00f3","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00108-0_BIB6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(03)00108-0_BIB7","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1002\/jgt.3190170610","article-title":"Two trees in maximal planar bipartite graphs","volume":"17","author":"Ringel","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00108-0_BIB8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01848836","article-title":"The tree number of a graph with a given girth","volume":"19","author":"Truszczy\u0144ski","year":"1988","journal-title":"Period. Math. Hungar."},{"issue":"1","key":"10.1016\/S0012-365X(03)00108-0_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/jctb.1999.1934","article-title":"Packing and decomposition of graphs with trees","volume":"78","author":"Yuster","year":"2000","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:26:22Z","timestamp":1553073982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03001080"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00108-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}