{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:35:53Z","timestamp":1774625753223,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"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":[[1990,4]]},"DOI":"10.1016\/0012-365x(90)90145-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"137-145","source":"Crossref","is-referenced-by-count":5,"title":["The number of cutvertices in graphs with given minimum degree"],"prefix":"10.1016","volume":"81","author":[{"given":"L.H.","family":"Clark","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.C.","family":"Entringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90145-8_BIB1","series-title":"Graph Theory","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/0012-365X(90)90145-8_BIB2","unstructured":"L.H. Clark and R.C. Entringer, The number of cutvertices in a 2t-regular graph (in preparation)."},{"issue":"2\u20134","key":"10.1016\/0012-365X(90)90145-8_BIB3","first-page":"295","article-title":"The number of cutvertices in a regular graph","volume":"17","author":"Nirmala","year":"1975","journal-title":"Cahiers Centre \u00c9tudes Recherche Oper."},{"key":"10.1016\/0012-365X(90)90145-8_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02760258","article-title":"An extremal problem in graph theory","volume":"6","author":"Rao","year":"1968","journal-title":"Israel J. Math."},{"key":"10.1016\/0012-365X(90)90145-8_BIB5","series-title":"Ph.D. thesis","article-title":"Some extremal problems and characterizations in the theory of graphs","author":"Rao","year":"1969"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X90901458?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X90901458?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:21Z","timestamp":1555120401000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X90901458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["0012365X90901458"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90145-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}