{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:59:50Z","timestamp":1720054790654},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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,2]]},"DOI":"10.1016\/s0012-365x(99)90057-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"169-178","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["The number of maximal independent sets in connected triangle-free graphs"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Jen","family":"Jou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90057-2_BIB1","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1006\/aama.1996.0509","article-title":"The cardinality of the collection of maximum independent sets of a graph","volume":"18","author":"Chang","year":"1997","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB2","series-title":"Seminaire Lotharingien de Combinatoire 10eme session","first-page":"48","article-title":"Counting stable sets in trees","author":"Cohen","year":"1984"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB3","series-title":"Graph Theory, Combinatorics, Algorithms and Applications","first-page":"140","article-title":"On clique of graphs","author":"Fan","year":"1991"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/net.3230230308","article-title":"An upper bound on the number of cliques in a graph","volume":"23","author":"Farber","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB5","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\/S0012-365X(99)90057-2_BIB6","unstructured":"J.R. Griggs, C.M. Grinstead, unpublished result, 1986."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB7","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\/S0012-365X(99)90057-2_BIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(85)90077-9","article-title":"The maximum number of cliques in dense graphs","volume":"54","author":"Hedman","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0012-365X(85)90177-3","article-title":"Graphs with unique maximum independent sets","volume":"57","author":"Hopkins","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB10","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\/S0012-365X(99)90057-2_BIB11","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB12","article-title":"The number of maximal independent sets in graphs","author":"Jou","year":"1990"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB13","article-title":"Counting independent sets","author":"Jou","year":"1996"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(97)00033-4","article-title":"Maximal independent sets in graphs with at most one cycle","volume":"79","author":"Jou","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB15","series-title":"Proc. 2nd Asian Mathematical Conf., World Scientific","first-page":"265","article-title":"Survey on counting maximal independent sets","author":"Jou","year":"1995"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB16","unstructured":"M.J. Jou, G.J. Chang, Counting maximum independent sets, submitted."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB17","unstructured":"M.J. Jou, G.J. Chang, Algorithmic aspects of counting independent sets. submitted."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01858464","article-title":"A finiteness theorem for maximal independent sets","volume":"12","author":"Jou","year":"1996","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB19","first-page":"199","article-title":"Trees and forests of the same order with large and small independent indices","volume":"32","author":"Lin","year":"1995","journal-title":"Chinese J. Math."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0012-365X(89)90306-3","article-title":"Bipartite graphs can have any number of independent sets","volume":"76","author":"Linek","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90057-2_BIB21","article-title":"Maximal and maximum independent sets in graphs","author":"Liu","year":"1992"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB22","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\/S0012-365X(99)90057-2_BIB23","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190120217","article-title":"On maximal independent sets of nodes in trees","volume":"12","author":"Meir","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB24","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\/S0012-365X(99)90057-2_BIB25","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\/S0012-365X(99)90057-2_BIB26","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"},{"key":"10.1016\/S0012-365X(99)90057-2_BIB27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/jgt.3190150208","article-title":"The structure and maximum number of maximum independent sets in trees","volume":"15","author":"Zito","year":"1991","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900572?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900572?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:22:13Z","timestamp":1553214133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":27,"alternative-id":["S0012365X99900572"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90057-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}