{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:22:54Z","timestamp":1770355374128,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0012-365x(79)90139-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"321-323","source":"Crossref","is-referenced-by-count":16,"title":["On graphs with equal edge connectivity and minimum degree"],"prefix":"10.1016","volume":"28","author":[{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90139-0_BIB1","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(79)90139-0_BIB2","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/0114065","article-title":"A graph-theoretic approach to a communication problem","volume":"14","author":"Chartrand","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0012-365X(79)90139-0_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0012-365X(78)90184-X","article-title":"On graphs with equal edge-connectivity and minimum degree","volume":"23","author":"Goldsmith","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(79)90139-0_BIB4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0012-365X(74)90154-X","article-title":"Results on the edge-connectivity of graphs","volume":"8","author":"Lesniak","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(79)90139-0_BIB5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.2307\/1970010","article-title":"Studies on directed graphs","volume":"63","author":"Ore","year":"1956","journal-title":"Ann. of Math."},{"key":"10.1016\/0012-365X(79)90139-0_BIB6","first-page":"71","article-title":"Critical graphs of given diameter","volume":"30","author":"Plesnik","year":"1975","journal-title":"Acta Fac. Rev. Nat. Univ. Comen. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:23:34Z","timestamp":1555154614000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79901390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X79901390"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90139-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}