{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:49:23Z","timestamp":1768733363405,"version":"3.49.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0095-8956(02)00013-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T17:16:12Z","timestamp":1051118172000},"page":"53-65","source":"Crossref","is-referenced-by-count":46,"title":["Edge-disjoint trees containing some given vertices in a graph"],"prefix":"10.1016","volume":"88","author":[{"given":"Matthias","family":"Kriesell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(02)00013-8_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0095-8956(02)00013-8_BIB2","volume":"Vol. 173","author":"Diestel","year":"1997"},{"key":"10.1016\/S0095-8956(02)00013-8_BIB3","series-title":"Studies in the theory of graphs, Thesis","author":"Gupta","year":"1967"},{"key":"10.1016\/S0095-8956(02)00013-8_BIB4","first-page":"257","article-title":"Short proofs of theorems of Nash-Williams and Tutte","volume":"50","author":"Hakimi","year":"1998","journal-title":"Ars Combin."},{"key":"10.1016\/S0095-8956(02)00013-8_BIB5","unstructured":"A.J.W. Hilton, The cover index, the chromatic index and the minimum degree of a graph, in: \u201cProceedings of the 5th British Combinatorial Conference,\u201d Aberdeen, 1975; Congr. Numer. XV (1976), 307\u2013317."},{"key":"10.1016\/S0095-8956(02)00013-8_BIB6","unstructured":"A. Frank, T. Kir\u00e1ly, M. Kriesell, On decomposing a hypergraph into k connected sub-hypergraphs, submitted."},{"key":"10.1016\/S0095-8956(02)00013-8_BIB7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/mana.19790930116","article-title":"Eine Reduktionsmethode f\u00fcr den Kantenzusammenhang in Graphen","volume":"93","author":"Mader","year":"1979","journal-title":"Math. Nachr."},{"key":"10.1016\/S0095-8956(02)00013-8_BIB8","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\/S0095-8956(02)00013-8_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0095-8956(84)90069-8","article-title":"Paths and edge connectivity in graphs","volume":"37","author":"Okamura","year":"1984","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0095-8956(02)00013-8_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0095-8956(02)00013-8_BIB11","series-title":"Domatic numbers of graphs and their variants: a survey","author":"Zelinka","year":"1998"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000138?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895602000138?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T15:25:26Z","timestamp":1553527526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895602000138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0095895602000138"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(02)00013-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}