{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:04:14Z","timestamp":1648566254075},"reference-count":5,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":3791,"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":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00194-4","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"181-195","source":"Crossref","is-referenced-by-count":0,"title":["Subgraphs decomposable into two trees and k-edge-connected subgraphs"],"prefix":"10.1016","volume":"126","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00194-4_BIB1","unstructured":"A. Frank, Connectivity and network flows, in: R. Graham, M. Grotschel, L. Lov\u00e1sz (Eds.), Handbook of Combinatorics, Elsevier Science, Amsterdam, 1995 (Chapter 2)."},{"key":"10.1016\/S0166-218X(02)00194-4_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(83)90031-5","article-title":"Connectivity and edge-disjoint spanning trees","volume":"16","author":"Gusfield","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(02)00194-4_BIB3","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(02)00194-4_BIB4","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/moor.10.4.701","article-title":"A note on finding minimum-cost edge-disjoint spanning trees","volume":"10","author":"Roskind","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00194-4_BIB5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing graph into n connected factors","volume":"142","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001944?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001944?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T10:54:22Z","timestamp":1555152862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02001944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":5,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02001944"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00194-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}