{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:47:07Z","timestamp":1649141227587},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0012-365x(96)00028-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"179-189","source":"Crossref","is-referenced-by-count":0,"title":["Clique neighborhoods and nearly chordal graphs"],"prefix":"10.1016","volume":"171","author":[{"given":"Terry A.","family":"McKee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00028-3_BIB1","first-page":"1","article-title":"An introduction to chordal graphs and clique trees","volume":"Vol. 56","author":"Blair","year":"1993"},{"key":"10.1016\/S0012-365X(96)00028-3_BIB2","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(96)00028-3_BIB3","series-title":"Transformations of graphs which do not change the Euler characteristic of graphs","first-page":"219","article-title":"Representation of smooth surfaces by graphs","volume":"122","author":"Ivashchenko","year":"1993"},{"key":"10.1016\/S0012-365X(96)00028-3_BIB4","first-page":"27","article-title":"How chordal graphs work","volume":"9","author":"McKee","year":"1993","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/S0012-365X(96)00028-3_BIB5","unstructured":"T.A. McKee, Beyond chordal graphs, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/S0012-365X(96)00028-3_BIB6","series-title":"Combinatorial Mathematics","first-page":"300","article-title":"Decompositions of graphs and hypergraphs","volume":"Vol. 686","author":"Speed","year":"1978"},{"key":"10.1016\/S0012-365X(96)00028-3_BIB7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0012-365X(94)90393-X","article-title":"The generating polynomial and Euler characteristic of intersection graphs","volume":"131","author":"Yeh","year":"1994","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000283?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000283?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:28:23Z","timestamp":1556130503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0012365X96000283"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00028-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}