{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T08:54:17Z","timestamp":1648716857108},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0166-218x(92)90285-i","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T21:10:39Z","timestamp":1039554639000},"page":"197-211","source":"Crossref","is-referenced-by-count":1,"title":["Extensions de r\u00e9seaux de connexit\u00e9 donn\u00e9e"],"prefix":"10.1016","volume":"24","author":[{"given":"Jean-Claude","family":"Konig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90285-I_BIB1","series-title":"Survey in Combinatorics","first-page":"1","article-title":"Graphs theory interconnection networks: Diameter and vulnerability","volume":"82","author":"Bermond","year":"1983"},{"key":"10.1016\/0166-218X(92)90285-I_BIB2","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: Some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0166-218X(92)90285-I_BIB3","series-title":"Th\u00e8se","article-title":"Extension de r\u00e9seaux d'interconnexion","author":"Berrada","year":"1986"},{"key":"10.1016\/0166-218X(92)90285-I_BIB4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0095-8956(81)90043-5","article-title":"Indestructive deletions of edges from graphs","volume":"30","author":"Bollobas","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(92)90285-I_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/net.3230030303","article-title":"On the existence of n-connected graphs with prescribed degrees (n\u22652)","volume":"3","author":"Wang","year":"1973","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290285I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290285I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:44Z","timestamp":1555134944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290285I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0166218X9290285I"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90285-i","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}