{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T06:18:04Z","timestamp":1768976284442,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0166-218x(97)00033-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"67-73","source":"Crossref","is-referenced-by-count":33,"title":["Maximal independent sets in graphs with at most one cycle"],"prefix":"10.1016","volume":"79","author":[{"given":"Min-Jen","family":"Jou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00033-4_BIB1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190110403","article-title":"The number of maximal independent sets in connected graphs","volume":"11","author":"F\u00fcredi","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00033-4_BIB2","unstructured":"J.R. Griggs, C.M. Grinstead, 1986, unpublished result."},{"key":"10.1016\/S0166-218X(97)00033-4_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(88)90114-8","article-title":"The number of maximal independent sets in a connected graph","volume":"68","author":"Griggs","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00033-4_BIB4","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0406022","article-title":"The number of maximal independent sets in triangle-free graphs","volume":"6","author":"Hujter","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00033-4_BIB5","article-title":"The Number of Maximal Independent Sets in Graphs","author":"Jou","year":"1991"},{"key":"10.1016\/S0166-218X(97)00033-4_BIB6","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/jgt.3190170407","article-title":"Maximal independent sets in bipartite graphs","volume":"17","author":"Liu","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00033-4_BIB7","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\/S0166-218X(97)00033-4_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/0401012","article-title":"A note on independent sets in trees","volume":"1","author":"Sagan","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00033-4_BIB9","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. Algebraic Discrete Methods"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000334?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:50:15Z","timestamp":1556131815000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0166218X97000334"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00033-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}