{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:12:53Z","timestamp":1773234773133,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0095-8956(79)90049-2","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"111-122","source":"Crossref","is-referenced-by-count":39,"title":["On a general class of graph polynomials"],"prefix":"10.1016","volume":"26","author":[{"given":"E.J","family":"Farrell","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(79)90049-2_BIB1","unstructured":"J. W. Moon, \u201cCounting Labelled Trees: A Survey of Methods and Results,\u201d Dept. of Math. University of Alberta."},{"key":"10.1016\/0095-8956(79)90049-2_BIB2","unstructured":"J. Riordan, \u201cAn Introduction to Combinatorial Analysis,\u201d Wiley, New York."},{"key":"10.1016\/0095-8956(79)90049-2_BIB3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.5486\/PMD.1964.11.1-4.15","article-title":"Beziehungen zwischen den in einem graphen enthaltenen Kreisen und seinem charakteristischen polynom","volume":"11","author":"Sachs","year":"1964","journal-title":"Publ. Math. Debrecen."},{"key":"10.1016\/0095-8956(79)90049-2_BIB4","series-title":"Graphs and Combinatorics","first-page":"153","article-title":"Computing the characteristic polynomial of a graph","author":"Schwenk","year":"1974"},{"key":"10.1016\/0095-8956(79)90049-2_BIB5","series-title":"Sixteenth Midwest Symposium on Circuit Theory","first-page":"XI.1","article-title":"The tree number and its generalizations","volume":"Vol. 2","author":"Tutte","year":"1973"},{"key":"10.1016\/0095-8956(79)90049-2_BIB6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0021-9800(67)80032-2","article-title":"On dichromatic polynomials","volume":"2","author":"Tutte","year":"1967","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(79)90049-2_BIB7","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1090\/S0002-9904-1932-05460-X","article-title":"A logical expansion in mathematics","volume":"38","author":"Whitney","year":"1932","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T03:18:52Z","timestamp":1682997532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895679900492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0095895679900492"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(79)90049-2","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}