{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:15Z","timestamp":1720640835932},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80143-x","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T07:08:52Z","timestamp":1114931332000},"page":"126-129","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["EDGE-CONNECTIVITIES OF GRAPHS AND DIGRAPHS"],"prefix":"10.1016","volume":"5","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"No. 4","key":"10.1016\/S1571-0653(05)80143-X_BIB1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM J. Computing"},{"issue":"No. 3","key":"10.1016\/S1571-0653(05)80143-X_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0095-8956(80)90071-4","article-title":"On the orientation of graphs","volume":"B 28","author":"Frank","year":"1980","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/S1571-0653(05)80143-X_BIB3","series-title":"Lecture Notes in Computer Science 1610","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-48777-8_15","article-title":"Parity constrained K-edge-connected orientations","author":"Frank","year":"1999"},{"key":"10.1016\/S1571-0653(05)80143-X_BIB4","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S1571-0653(05)80143-X_BIB5","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":"Europ. J. Combinatorics"},{"key":"10.1016\/S1571-0653(05)80143-X_BIB6","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On orientations, connectivity and odd vertex pairings in finite graphs","volume":"12","author":"Nash-Williams","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/S1571-0653(05)80143-X_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2303897","article-title":"A theorem on graphs with an application to a problem of traffic control","volume":"46","author":"Robbins","year":"1939","journal-title":"American Math. Monthly"},{"key":"10.1016\/S1571-0653(05)80143-X_BIB8","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."},{"issue":"No.1","key":"10.1016\/S1571-0653(05)80143-X_BIB9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","article-title":"Edge-connectivity augmentation problems","volume":"35","author":"Watanabe","year":"1987","journal-title":"Computer and System Sciences"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530580143X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530580143X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T14:58:06Z","timestamp":1548514686000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106530580143X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":9,"alternative-id":["S157106530580143X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80143-x","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}