{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:00:25Z","timestamp":1649210425778},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf01858464","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T22:44:16Z","timestamp":1121294656000},"page":"321-326","source":"Crossref","is-referenced-by-count":7,"title":["A finiteness theorem for maximal independent sets"],"prefix":"10.1007","volume":"12","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"}]},{"given":"Chiang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tze-Heng","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,30]]},"reference":[{"key":"1858464_CR1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190110403","volume":"11","author":"Z. F\u00fcredi","year":"1987","unstructured":"F\u00fcredi, Z.: The number of maximal independent sets in connected graphs. J. Graph Theory11, 463\u2013470 (1987)","journal-title":"J. Graph Theory"},{"key":"1858464_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(88)90114-8","volume":"68","author":"J.R. Griggs","year":"1988","unstructured":"Griggs, J.R., Grinstead, C.M., Guichard, D.R.: The number of maximal independent sets in a connected graph. Discrete Math.68, 211\u2013220 (1988)","journal-title":"Discrete Math."},{"key":"1858464_CR3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0406022","volume":"6","author":"M. Hujter","year":"1993","unstructured":"Hujter, M., Tuza, Z.: The number of maximal independent sets in triangle-free graphs. SIAM J. Disc. Math.6, 284\u2013288 (1993)","journal-title":"SIAM J. Disc. Math."},{"key":"1858464_CR4","volume-title":"The Number of Maximal Independent Sets in Graphs","author":"M.-J. Jou","year":"1991","unstructured":"Jou, M.-J.: The Number of Maximal Independent Sets in Graphs, Master's thesis, Dept. of Math., National Central Univ., Taiwan (1991)"},{"key":"1858464_CR5","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/jgt.3190170407","volume":"17","author":"J. Liu","year":"1993","unstructured":"Liu, J.: Maximal independent sets in bipartite graphs. J. Graph Theory17, 495\u2013507 (1993)","journal-title":"J. Graph Theory"},{"key":"1858464_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190120217","volume":"12","author":"A. Meir","year":"1988","unstructured":"Meir, A., Moon, J.W.: On maximal independent sets of nodes in trees. J. Graph Theory12, 265\u2013283 (1988)","journal-title":"J. Graph Theory"},{"key":"1858464_CR7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math.3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"1858464_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/0401012","volume":"1","author":"B.E. Sagan","year":"1988","unstructured":"Sagan, B.E.: A note on independent sets in trees. SIAM J. Disc. Math.1, 105\u2013108 (1988)","journal-title":"SIAM J. Disc. Math."},{"key":"1858464_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1137\/0607015","volume":"7","author":"H.S. Wilf","year":"1986","unstructured":"Wilf, H.S.: The number of maximal independent sets in a tree. SIAM J. Alg. Disc. Meth.7, 125\u2013130 (1986)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"1858464_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/jgt.3190150208","volume":"15","author":"J. Zito","year":"1991","unstructured":"Zito, J.: The structure and maximum number of maximum independent sets in trees. J. Graph Theory15, 207\u2013211 (1991)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01858464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01858464\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01858464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T14:25:33Z","timestamp":1557498333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01858464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["1858464"],"URL":"https:\/\/doi.org\/10.1007\/bf01858464","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}