{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:12:29Z","timestamp":1649139149970},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"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":[[1998,6]]},"DOI":"10.1016\/s0012-365x(97)00253-7","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"175-182","source":"Crossref","is-referenced-by-count":0,"title":["Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem"],"prefix":"10.1016","volume":"188","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00253-7_BIB1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/jgt.3190090303","article-title":"Edge-disjoint spanning trees: a connectedness theorem","volume":"9","author":"Farber","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00253-7_BIB2","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0012-365X(89)90267-7","article-title":"Basis pairs graphs of transversal matroids are connected","volume":"73","author":"Farber","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00253-7_BIB3","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/jgt.3190130606","article-title":"Classification of interpolation theorems for spanning trees and other families of spanning subgraphs","volume":"13","author":"Harary","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00253-7_BIB4","article-title":"Transformation graphs","author":"Li","year":"1991"},{"key":"10.1016\/S0012-365X(97)00253-7_BIB5","first-page":"18","article-title":"Matroid Theory","author":"Oxley","year":"1992"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002537?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97002537?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:20:52Z","timestamp":1556169652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97002537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0012365X97002537"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00253-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}