{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:30:12Z","timestamp":1649187012281},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"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":3490,"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":[[2004,2]]},"DOI":"10.1016\/s0012-365x(03)00291-7","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T22:32:50Z","timestamp":1063751570000},"page":"5-28","source":"Crossref","is-referenced-by-count":0,"title":["Splitting off edges between two subsets preserving the edge-connectivity of the graph"],"prefix":"10.1016","volume":"276","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0012-365X(03)00291-7_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/S0036142993226983","article-title":"Preserving and increasing local edge-connectivity in mixed graphs","volume":"8","author":"Bang-Jensen","year":"1995","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"10.1016\/S0012-365X(03)00291-7_BIB2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","article-title":"Edge-connectivity augmentation with partition constraints","volume":"12","author":"Bang-Jensen","year":"1999","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/S0012-365X(03)00291-7_BIB3","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/S0895480197318878","article-title":"Edge-connectivity augmentation preserving simplicity","volume":"11","author":"Bang-Jensen","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00291-7_BIB4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1006\/jagm.2000.1119","article-title":"Splitting off edges within a specified subset preserving the edge-connectivity of the graph","volume":"37","author":"Bang-Jensen","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(03)00291-7_BIB5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/net.3230190112","article-title":"The minimum augmentation of any graph to a k-edge-connected graph","volume":"19","author":"Cai","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(03)00291-7_BIB6","doi-asserted-by":"crossref","unstructured":"A. Frank, On Connectivity Properties of Eulerian Digraphs, Graph Theory in Memory of G.A. Dirac Sandbjerg, 1985, pp. 179\u2013194, Annals of Discrete Mathematics, Vol. 41, North-Holland, Amsterdam, New York, l989.","DOI":"10.1016\/S0167-5060(08)70459-X"},{"key":"10.1016\/S0012-365X(03)00291-7_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","article-title":"Augmenting graphs to meet edge-connectivity requirements","volume":"5","author":"Frank","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(03)00291-7_BIB8","series-title":"Mathematical Programming: State of the Art 1994, The University of Michigan, Ann Arbor, MI","first-page":"34","article-title":"Connectivity augmentation problems in network design","author":"Frank","year":"1994"},{"key":"10.1016\/S0012-365X(03)00291-7_BIB9","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C.L. Monma, M. Stoer, Design of survivable networks, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Handbook in Operations Research and Management Science, Network Models, Vol. 7, North-Holland, Amsterdam, 1994, pp. 617\u2013672.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"issue":"3","key":"10.1016\/S0012-365X(03)00291-7_BIB10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jgt.3190120314","article-title":"Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs","volume":"12","author":"Jackson","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00291-7_BIB11","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, North-Holland, Amsterdam 1979."},{"key":"10.1016\/S0012-365X(03)00291-7_BIB12","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."},{"issue":"1","key":"10.1016\/S0012-365X(03)00291-7_BIB13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","article-title":"Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen","volume":"3","author":"Mader","year":"1982","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(03)00291-7_BIB14","doi-asserted-by":"crossref","unstructured":"H. Nagamochi, P. Eades, Edge-splitting and edge-connectivity augmentation in planar graphs, in: R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado (Eds.), IPCO VI Lecture Notes in Computer Science, Vol. 1412, Springer-Verlag, Berlin, Heidelberg, 1998, pp. 96\u2013111.","DOI":"10.1007\/3-540-69346-7_8"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002917?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002917?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T15:59:55Z","timestamp":1585151995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0012365X03002917"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00291-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}