{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:20:46Z","timestamp":1648876846250},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00493-011-2570-2","type":"journal-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T11:38:56Z","timestamp":1312976336000},"page":"201-223","source":"Crossref","is-referenced-by-count":0,"title":["The constructive characterization of (\u03ba,\u2113)-edge-connected digraphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Erika R.","family":"Kov\u00e1cs","sequence":"first","affiliation":[]},{"given":"L\u00e1szl\u00f3 A.","family":"V\u00e9gh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,11]]},"reference":[{"key":"2570_CR1","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds: Edge disjoint branchings, in: Combinatorial Algorithms (B. Rustin, ed.), pages 91\u201396, Academic Press, New York, 1973."},{"issue":"3","key":"2570_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","volume":"28","author":"A. Frank","year":"1980","unstructured":"A. Frank: On the orientation of graphs, J. Comb. Theory, Ser. B. 28(3) (1980), 251\u2013261.","journal-title":"J. Comb. Theory, Ser. B"},{"key":"2570_CR3","unstructured":"A. Frank: Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art ( J. Birge and K. Murty, eds.), pages 34\u201363, The University of Michigan, 1999."},{"key":"2570_CR4","doi-asserted-by":"crossref","unstructured":"A. Frank: Edge-connection of graphs, digraphs, and hypergraphs; in: More sets, graphs and numbers ( E. Gy\u0151ri, G. Katona, and L. Lov\u00e1sz, eds.), Bolyai Mathematical Society Math. Studies, volume 5, pages 93\u2013142, Springer Verlag, 2006.","DOI":"10.1007\/978-3-540-32439-3_6"},{"issue":"1","key":"2570_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s004930200003","volume":"22","author":"A. Frank","year":"2002","unstructured":"A. Frank and Z. Kir\u00e1ly: Graph orientations with edge-connection and parity constraints, Combinatorica 22(1) (2002), 47\u201370.","journal-title":"Combinatorica"},{"issue":"2","key":"2570_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0166-218X(02)00464-X","volume":"131","author":"A. Frank","year":"2003","unstructured":"A. Frank and L. Szeg\u0151: Constructive characterizations for packing and covering with trees, Discrete Appl. Math. 131(2) (2003), 347\u2013371.","journal-title":"Discrete Appl. Math."},{"key":"2570_CR7","volume-title":"The splitting off operation and its applications","author":"T. Kir\u00e1ly","year":"1999","unstructured":"T. Kir\u00e1ly: The splitting off operation and its applications, Master\u2019s thesis, E\u00f6tv\u00f6s University, Budapest, 1999, available online at http:\/\/www.cs.elte.hu ."},{"key":"2570_CR8","first-page":"147","volume":"23","author":"E. R. Kov\u00e1cs","year":"2010","unstructured":"E. R. Kov\u00e1cs and L. A. V\u00e9gh: Constructive characterization theorems in combinatorial optimization, RIMS K\u00f4ky\u00fbroku Bessatsu 23 (2010), 147\u2013169.","journal-title":"RIMS K\u00f4ky\u00fbroku Bessatsu"},{"key":"2570_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","volume":"3","author":"W. Mader","year":"1982","unstructured":"W. Mader: Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen, Europ. J. Combinatorics 3 (1982), 63\u201367.","journal-title":"Europ. J. Combinatorics"},{"key":"2570_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"s1\u201336","author":"W. T. Tutte","year":"1961","unstructured":"W. T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc. s1\u201336 (1961), 221\u2013230.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2570-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-011-2570-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-011-2570-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:41:40Z","timestamp":1560469300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-011-2570-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["2570"],"URL":"https:\/\/doi.org\/10.1007\/s00493-011-2570-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}