{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T20:39:05Z","timestamp":1714509545439},"reference-count":9,"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)00582-6","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T14:54:32Z","timestamp":1058367272000},"page":"555-559","source":"Crossref","is-referenced-by-count":5,"title":["Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs"],"prefix":"10.1016","volume":"131","author":[{"given":"J\u00d8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00582-6_BIB1","unstructured":"J. Bang-Jensen, G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer, London, 2000, 754 pp+xxii."},{"key":"10.1016\/S0166-218X(02)00582-6_BIB2","unstructured":"P. Duchet, Hypergraphs, in: R.L. Graham, M. Gr\u00f6tschel, L. Lov\u00e1sz (Eds.), Handbook of Combinatorics, 1995, North-Holland, Amsterdam, pp. 381\u2013432."},{"key":"10.1016\/S0166-218X(02)00582-6_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent sets","volume":"869","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Stand. Sect."},{"key":"10.1016\/S0166-218X(02)00582-6_BIB4","series-title":"Combinatorial Algorithms","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/S0166-218X(02)00582-6_BIB5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(93)90158-P","article-title":"Submodular functions in graph theory","volume":"111","author":"Frank","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00582-6_BIB6","unstructured":"A. Frank, Edge-connection of graphs and hypergraphs, submitted for publication."},{"key":"10.1016\/S0166-218X(02)00582-6_BIB7","doi-asserted-by":"crossref","unstructured":"A. Frank, T. Kir\u00e1ly, Z. Kir\u00e1ly, On the orientation of graphs and hypergraphs, in: S. Fujishige (Ed.), Discrete Appl. Math., this issue, PII: S0166-218X(02)00462-6.","DOI":"10.1016\/S0166-218X(02)00462-6"},{"key":"10.1016\/S0166-218X(02)00582-6_BIB8","doi-asserted-by":"crossref","unstructured":"A. Frank, T. Kir\u00e1ly, M. Kriesell, On decomposing hypergraphs into k connected sub-hypergraphs, in: S. Fukishige (Ed.), Discrete Appl. Math., this issue, PII: S0166-218X(02)00463-8.","DOI":"10.1016\/S0166-218X(02)00463-8"},{"key":"10.1016\/S0166-218X(02)00582-6_BIB9","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:S0166218X02005826?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02005826?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:51:34Z","timestamp":1552830694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02005826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02005826"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00582-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}