{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T09:31:19Z","timestamp":1780565479007,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T00:00:00Z","timestamp":1378771200000},"content-version":"vor","delay-in-days":11516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1016\/s0195-6698(82)80009-7","type":"journal-article","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T01:48:46Z","timestamp":1378777726000},"page":"63-67","source":"Crossref","is-referenced-by-count":41,"title":["Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen"],"prefix":"10.1016","volume":"3","author":[{"given":"W.","family":"Mader","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(82)80009-7_bib1","first-page":"341","article-title":"Nombre d'arcs dans les graphes k-arc-fortement connexes minimaux","volume":"285","author":"Dalmazzo","year":"1977","journal-title":"C.R. Acad. Sci. Paris, Ser. A"},{"key":"10.1016\/S0195-6698(82)80009-7_bib2","series-title":"Dissertation","article-title":"Sur la k-connexit\u00e9 et la k-forte connexit\u00e9 dans les graphes","author":"Dalmazzo","year":"1978"},{"key":"10.1016\/S0195-6698(82)80009-7_bib3","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0195-6698(82)80009-7_bib4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01238648","article-title":"Ecken vom Innen- and Au\u03b2engrad n in minimal n-fach kantenzusammenh\u00e4ngenden Digraphen","volume":"25","author":"Mader","year":"1974","journal-title":"Arch. Math."},{"key":"10.1016\/S0195-6698(82)80009-7_bib5","series-title":"Advances in Graph Theory","article-title":"A reduction method for edge-connectivity in graphs","author":"Mader","year":"1978"},{"key":"10.1016\/S0195-6698(82)80009-7_bib6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/mana.19790930116","article-title":"Eine Reduktionsmethode f\u00fcr den Kantenzusammenhang in Graphen","volume":"93","author":"Mader","year":"1979","journal-title":"Math. Nachr."},{"key":"10.1016\/S0195-6698(82)80009-7_bib7","unstructured":"W. Mader, On a property of n-edge-connected digraphs, Combinatorica (to appear)."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669882800097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669882800097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T02:25:42Z","timestamp":1539397542000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669882800097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["S0195669882800097"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(82)80009-7","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}