{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:01:14Z","timestamp":1768010474726,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":9329,"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":[[1988]]},"DOI":"10.1016\/0012-365x(88)90114-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:32:03Z","timestamp":1034271123000},"page":"211-220","source":"Crossref","is-referenced-by-count":76,"title":["The number of maximal independent sets in a connected graph"],"prefix":"10.1016","volume":"68","author":[{"given":"Jerrold R.","family":"Griggs","sequence":"first","affiliation":[]},{"given":"Charles M.","family":"Grinstead","sequence":"additional","affiliation":[]},{"given":"David R.","family":"Guichard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90114-8_BIB1","unstructured":"Z. Fűredi, The number of maximal independent sets in connected graphs, preprint."},{"key":"10.1016\/0012-365X(88)90114-8_BIB2","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"1","key":"10.1016\/0012-365X(88)90114-8_BIB3","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."},{"key":"10.1016\/0012-365X(88)90114-8_BIB4","unstructured":"B.E. Sagan, Independent sets in trees, preprint."},{"key":"10.1016\/0012-365X(88)90114-8_BIB5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1137\/0607015","article-title":"The number of maximal independent sets in a tree","volume":"7","author":"Wilf","year":"1986","journal-title":"SIAM J. Alg. Discrete Methods"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901148?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88901148?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:24:19Z","timestamp":1555115059000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88901148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":5,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988]]}},"alternative-id":["0012365X88901148"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90114-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}