{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:37:27Z","timestamp":1649183847589},"reference-count":4,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":5130,"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":[[1999,7]]},"DOI":"10.1016\/s0012-365x(99)00107-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"245-247","source":"Crossref","is-referenced-by-count":3,"title":["A new characterization of strongly chordal graphs"],"prefix":"10.1016","volume":"205","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)00107-7_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)00107-7_BIB2","doi-asserted-by":"crossref","unstructured":"T.A. McKee, F.R. McMorris, Topics in Intersection Graph Theory, Society for Industrial and Applied Mathematics, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719802"},{"key":"10.1016\/S0012-365X(99)00107-7_BIB3","first-page":"216","article-title":"Hereditary clique-Helly graphs","volume":"14","author":"Prisner","year":"1993","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(99)00107-7_BIB4","first-page":"187","article-title":"On maximal clique irreducible graphs","volume":"8","author":"Wallis","year":"1990","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99001077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99001077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:24:57Z","timestamp":1556652297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99001077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":4,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0012365X99001077"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)00107-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}