{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:35:28Z","timestamp":1759365328101,"version":"build-2065373602"},"reference-count":43,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0196-8858(02)00530-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T17:33:30Z","timestamp":1049477610000},"page":"160-176","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["Farrell polynomials on graphs of bounded tree width"],"prefix":"10.1016","volume":"30","author":[{"given":"J.A.","family":"Makowsky","sequence":"first","affiliation":[]},{"given":"J.P.","family":"Mari\u00f1o","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-8858(02)00530-4_BIB001","unstructured":"R. Arratia, B. Bollobas, G.B. Sorkin, The interlace polynomial: A new graph polynomial, IBM Research Report RC 21813 (98165), 31 July 2000"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB002","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB003","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0012-365X(98)00113-7","article-title":"An algorithm for the Tutte polynomials of graphs of bounded treewidth","volume":"190","author":"Andrzejak","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0196-8858(02)00530-4_BIB004","series-title":"Proceedings of the 22th International Symposium on the Mathematical Foundation of Computer Science, MFCS'97","first-page":"29","volume":"1295","author":"Bodlaender","year":"1997"},{"year":"1979","series-title":"Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/S0196-8858(02)00530-4_BIB005"},{"year":"1999","series-title":"Modern Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/S0196-8858(02)00530-4_BIB006"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB007","series-title":"Combinatorics and Graph Theory","first-page":"42","article-title":"In search for a complete invariant of graphs","volume":"885","author":"Balasubramanian","year":"1980"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB008","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1017\/S0963548398003447","article-title":"A Tutte polynomial for coloured graphs","volume":"8","author":"Bollob\u00e1s","year":"1999","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0196-8858(02)00530-4_BIB009","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/malq.19870330312","article-title":"The complexity of defining a relation on a finite graph","volume":"33","author":"Babai","year":"1987","journal-title":"Z. Math. Logik Grundlag. Math."},{"issue":"2","key":"10.1016\/S0196-8858(02)00530-4_BIB010","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique-width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Syst."},{"issue":"1\u20132","key":"10.1016\/S0196-8858(02)00530-4_BIB011","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","article-title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic","volume":"108","author":"Courcelle","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-8858(02)00530-4_BIB012","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90148-9","article-title":"Monadic second-order logic of graphs VII: Graphs as relational structures","volume":"101","author":"Courcelle","year":"1992","journal-title":"Theoret. Comput. Sci."},{"year":"1999","series-title":"Parametrized Complexity","author":"Downey","key":"10.1016\/S0196-8858(02)00530-4_BIB013"},{"article-title":"Graph Theory","year":"1996","author":"Diestel","key":"10.1016\/S0196-8858(02)00530-4_BIB014"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB015","series-title":"SIGACT'84","first-page":"409","article-title":"Uniform definability on finite structures with successor","author":"de Rougemont","year":"1984"},{"article-title":"Finite Model Theory","year":"1995","author":"Ebbinghaus","key":"10.1016\/S0196-8858(02)00530-4_BIB016"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB017","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1006\/jctb.1998.1853","article-title":"New results for the Martin polynomial","volume":"74","author":"Ellis-Monaghan","year":"1998","journal-title":"J. Combin. Theory Ser. B"},{"year":"1979","series-title":"Graph Algorithms","author":"Even","key":"10.1016\/S0196-8858(02)00530-4_BIB018"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB019","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\/S0196-8858(02)00530-4_BIB020","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0095-8956(79)90049-2","article-title":"On a general class of graph polynomials","volume":"26","author":"Farrell","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB021","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\/S0196-8858(02)00530-4_BIB022","first-page":"97","article-title":"Generalizations of the matching polynomial","volume":"24","author":"Gutman","year":"1983","journal-title":"Utilitas Math."},{"article-title":"Computers and Intractability","year":"1979","author":"Garey","key":"10.1016\/S0196-8858(02)00530-4_BIB023"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB024","series-title":"Database Theory, ICDT'99","first-page":"70","article-title":"Definability and descriptive complexity on databases of bounded tree-width","volume":"1540","author":"Grohe","year":"1999"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB025","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"},{"year":"1993","series-title":"Algebraic Combinatorics","author":"Godsil","key":"10.1016\/S0196-8858(02)00530-4_BIB026"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB027","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(94)90163-5","article-title":"Clique polynomials and independent set polynomials of graphs","volume":"125","author":"Hoede","year":"1994","journal-title":"Discrete Math."},{"year":"1986","series-title":"Matching Theory","author":"Lovasz","key":"10.1016\/S0196-8858(02)00530-4_BIB028"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB029","unstructured":"J.A. Makowsky, Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width, Discrete Appl. Math., to appear"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB030","article-title":"Model theory and computer science: An appetizer","volume":"1","author":"Makowsky","year":"1992"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB031","series-title":"Proceedings of the 12th Symposium on Discrete Algorithms","first-page":"487","article-title":"Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width","author":"Makowsky","year":"2001"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB032","unstructured":"J.A. Makowsky, J.P. Marino, The parametrized complexity of Knot polynomials, J. Comput. System Sci., to appear"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB033","unstructured":"S.D. Noble, Complexity of graph polynomials, PhD thesis, New College, Oxford University, England, 1997"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB034","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1017\/S0963548398003551","article-title":"Evaluating the Tutte polynomial for graphs of bounded tree-width","volume":"7","author":"Noble","year":"1998","journal-title":"Combin. Probab. Comput."},{"year":"1994","series-title":"Computational Complexity","author":"Papadimitriou","key":"10.1016\/S0196-8858(02)00530-4_BIB035"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB036","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0012-365X(98)00403-8","article-title":"Graph characterizing polynomials","volume":"206","author":"Parthasarathy","year":"1999","journal-title":"Discrete Math."},{"year":"1958","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","key":"10.1016\/S0196-8858(02)00530-4_BIB037"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB038","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."},{"year":"1986","series-title":"Enumerative Combinatorics","author":"Stanley","key":"10.1016\/S0196-8858(02)00530-4_BIB039"},{"key":"10.1016\/S0196-8858(02)00530-4_BIB040","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-8858(02)00530-4_BIB041","first-page":"397","article-title":"Le polyn\u00f4me de Martin d'un graphe eulerien","volume":"17","author":"Las Vergnas","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0196-8858(02)00530-4_BIB042","article-title":"Complexity: Knots, Colourings and Counting","volume":"186","author":"Welsh","year":"1993"},{"year":"1990","series-title":"generatingfunctionology","author":"Wilf","key":"10.1016\/S0196-8858(02)00530-4_BIB043"}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885802005304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885802005304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T06:44:38Z","timestamp":1759301078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885802005304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0196885802005304"],"URL":"https:\/\/doi.org\/10.1016\/s0196-8858(02)00530-4","relation":{},"ISSN":["0196-8858"],"issn-type":[{"type":"print","value":"0196-8858"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Farrell polynomials on graphs of bounded tree width","name":"articletitle","label":"Article Title"},{"value":"Advances in Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0196-8858(02)00530-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Science (USA). All rights reserved.","name":"copyright","label":"Copyright"}]}}