{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:15:41Z","timestamp":1781345741079,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3643,"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,9]]},"DOI":"10.1016\/s0166-218x(02)00463-8","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T11:29:34Z","timestamp":1060687774000},"page":"373-383","source":"Crossref","is-referenced-by-count":72,"title":["On decomposing a hypergraph into k connected sub-hypergraphs"],"prefix":"10.1016","volume":"131","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Kriesell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00463-8_BIB1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent sets","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/S0166-218X(02)00463-8_BIB2","series-title":"Combinatorial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0166-218X(02)00463-8_BIB3","first-page":"289","article-title":"Hypergraphes et matroides","volume":"17","author":"Lorea","year":"1975","journal-title":"Cahiers Centre Etudes Rech. Oper."},{"key":"10.1016\/S0166-218X(02)00463-8_BIB4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF01894789","article-title":"A generalization of K\u0151nig's theorem","volume":"21","author":"Lov\u00e1sz","year":"1970","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0166-218X(02)00463-8_BIB5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge-connectivity in graphs","volume":"3","author":"Mader","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00463-8_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\/S0166-218X(02)00463-8_BIB7","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004638?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004638?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T16:22:12Z","timestamp":1552580532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004638"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00463-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}