{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:56Z","timestamp":1773481976568,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,2,1]],"date-time":"1978-02-01T00:00:00Z","timestamp":255139200000},"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":12950,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1978,2]]},"DOI":"10.1016\/0095-8956(78)90071-0","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"1-13","source":"Crossref","is-referenced-by-count":25,"title":["k-Blocks and ultrablocks in graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"David W","family":"Matula","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(78)90071-0_BIB1","author":"Behzad","year":"1971"},{"key":"10.1016\/0095-8956(78)90071-0_BIB2","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(78)90071-0_BIB3","author":"Jardine","year":"1971"},{"key":"10.1016\/0095-8956(78)90071-0_BIB4","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","article-title":"k-degenerate graphs","volume":"22","author":"Lick","year":"1970","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(78)90071-0_BIB5","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/0122040","article-title":"k-components, clusters, and slicings in graphs","volume":"22","author":"Matula","year":"1972","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0095-8956(78)90071-0_BIB6","doi-asserted-by":"crossref","unstructured":"D. W. Matula, Subgraph connectivity numbers of a graph, in \u201cTheory and Applications of Graphs, 1976,\u201d Lecture Notes in Mathematics, Y. Alavi and D. R. Lick, ed., Springer-Verlag, heidelberg, in press.","DOI":"10.1007\/BFb0070394"},{"key":"10.1016\/0095-8956(78)90071-0_BIB7","series-title":"Classification and Clustering","first-page":"95","article-title":"Graph theoretic techniques for cluster analysis algorithms","author":"Matula","year":"1977"},{"key":"10.1016\/0095-8956(78)90071-0_BIB8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","volume":"3","author":"Moon","year":"1965","journal-title":"Israel J. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900710?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895678900710?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T02:50:58Z","timestamp":1549248658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895678900710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,2]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,2]]}},"alternative-id":["0095895678900710"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(78)90071-0","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1978,2]]}}}