{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T03:04:55Z","timestamp":1774839895536,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":7106,"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":[[1994,2]]},"DOI":"10.1016\/0012-365x(94)90163-5","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:41:28Z","timestamp":1034293288000},"page":"219-228","source":"Crossref","is-referenced-by-count":117,"title":["Clique polynomials and independent set polynomials of graphs"],"prefix":"10.1016","volume":"125","author":[{"given":"Cornelis","family":"Hoede","sequence":"first","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90163-5_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)90163-5_BIB2","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1974"},{"key":"10.1016\/0012-365X(94)90163-5_BIB3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(79)90070-4","article-title":"An introduction to matching polynomials","volume":"27","author":"Farrell","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)90163-5_BIB4","doi-asserted-by":"crossref","first-page":"610","DOI":"10.2307\/2325181","article-title":"The number of words of length n in a free \u201csemi abelian\u201d monoid","volume":"96","author":"Fisher","year":"1989","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(94)90163-5_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0012-365X(90)90202-S","article-title":"Dependence polynomials","volume":"82","author":"Fisher","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90163-5_BIB6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1002\/jgt.3190050310","article-title":"Matchings and walks in graphs","volume":"5","author":"Godsil","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)90163-5_BIB7","series-title":"Progress in Graph Theory","first-page":"281","article-title":"Real Graph Polynomial","author":"Godsil","year":"1984"},{"key":"10.1016\/0012-365X(94)90163-5_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/jgt.3190050203","article-title":"On the theory of the matching polynomial","volume":"5","author":"Godsil","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)90163-5_BIB9","first-page":"63","article-title":"The acyclic polynomial of a graph","volume":"22","author":"Gutman","year":"1977","journal-title":"Publ. Inst. Math"},{"key":"10.1016\/0012-365X(94)90163-5_BIB10","first-page":"97","article-title":"Generalizations of the matching polynomial","volume":"24","author":"Gutman","year":"1983","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(94)90163-5_BIB11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0095-8956(90)90079-F","article-title":"On the numbers of independent k-sets in a claw-free graph","volume":"50","author":"Hamidoune","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)90163-5_BIB12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0012-365X(88)90207-5","article-title":"Hard graphs for the maximum clique problem","volume":"72","author":"Hoede","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90163-5_BIB13","series-title":"Hard graphs for the Maximum Clique Problem II","author":"Hoede","year":"1991"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901635?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901635?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T11:55:24Z","timestamp":1554983724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94901635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0012365X94901635"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90163-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}