{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:30:59Z","timestamp":1762270259299},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90121-8","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:17:57Z","timestamp":1032283077000},"page":"267-277","source":"Crossref","is-referenced-by-count":20,"title":["On several sorts of connectivity"],"prefix":"10.1016","volume":"46","author":[{"given":"B.","family":"Peroche","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90121-8_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(83)90121-8_BIB2","first-page":"289","article-title":"Fuggetlen K\u00f6r\u00f6ket nem Tartalmazo gratokol","volume":"16","author":"Lov\u00e1sz","year":"1965","journal-title":"Math. Lapok"},{"key":"10.1016\/0012-365X(83)90121-8_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0012-365X(78)90198-X","article-title":"On k-minimally n-edge-connected graphs","volume":"24","author":"Maurer","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90121-8_BIB4","series-title":"Th\u00e8se d'Etat","article-title":"Connexit\u00e9 et indices de recouvrement dans les graphes","author":"Peroche","year":"1982"},{"key":"10.1016\/0012-365X(83)90121-8_BIB5","series-title":"Graph Theory and Applications","first-page":"235","article-title":"On the cyclic connectivity of planar graphs","author":"Plummer","year":"1972"},{"key":"10.1016\/0012-365X(83)90121-8_BIB6","first-page":"501","article-title":"Remarks on the colourings of maps","volume":"10","author":"Tait","year":"1880","journal-title":"Proc. Roy. Soc."},{"key":"10.1016\/0012-365X(83)90121-8_BIB7","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Amer. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:53:58Z","timestamp":1554825238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83901218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83901218"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90121-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}