{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:24:46Z","timestamp":1775057086866,"version":"3.50.1"},"reference-count":19,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2009,7]]},"abstract":"<jats:p>The <jats:italic>U<\/jats:italic>-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial, due to Stanley, are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any other. The definition of each of these functions suggests a natural way in which to strengthen them, which also captures Tutte's universal <jats:italic>V<\/jats:italic>-function as a specialization. We show that the equivalence remains true for the strong functions, thus answering a question raised by Dominic Welsh.<\/jats:p>","DOI":"10.1017\/s0963548309009845","type":"journal-article","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T18:32:33Z","timestamp":1238437953000},"page":"601-615","source":"Crossref","is-referenced-by-count":11,"title":["The Equivalence of Two Graph Polynomials and a Symmetric Function"],"prefix":"10.1017","volume":"18","author":[{"given":"CRIEL","family":"MERINO","sequence":"first","affiliation":[]},{"given":"STEVEN D.","family":"NOBLE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,7,1]]},"reference":[{"key":"S0963548309009845_ref5","first-page":"117","article-title":"Vassiliev knot invariants I: Introduction","volume":"21","author":"Chmutov","year":"1994","journal-title":"Adv. Soviet Math."},{"key":"S0963548309009845_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(81)90068-X"},{"key":"S0963548309009845_ref12","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/147\/01163"},{"key":"S0963548309009845_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662041.007"},{"key":"S0963548309009845_ref19","doi-asserted-by":"publisher","DOI":"10.2307\/1968214"},{"key":"S0963548309009845_ref14","doi-asserted-by":"publisher","DOI":"10.1006\/aima.1995.1020"},{"key":"S0963548309009845_ref6","first-page":"127","article-title":"Vassiliev knot invariants II: Intersection graph for trees","volume":"21","author":"Chmutov","year":"1994","journal-title":"Adv. Soviet Math."},{"key":"S0963548309009845_ref18","unstructured":"[18] Welsh D. J. A. (2005). Graph polynomials: Some questions. Talk at Annual One-Day Combinatorics Colloquium, Reading."},{"key":"S0963548309009845_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00146-0"},{"key":"S0963548309009845_ref7","first-page":"135","article-title":"Vassiliev knot invariants III: Forest algebra and weighted graphs","volume":"21","author":"Chmutov","year":"1994","journal-title":"Adv. Soviet Math."},{"key":"S0963548309009845_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s000260050008"},{"key":"S0963548309009845_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752506"},{"key":"S0963548309009845_ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1993.1026"},{"key":"S0963548309009845_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/1967597"},{"key":"S0963548309009845_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9022-9"},{"key":"S0963548309009845_ref9","volume-title":"Symmetric Functions and Hall Polynomials","author":"MacDonald","year":"1979"},{"key":"S0963548309009845_ref11","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1706"},{"key":"S0963548309009845_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00363-5"},{"key":"S0963548309009845_ref16","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100023173"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548309009845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T18:58:25Z","timestamp":1554663505000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548309009845\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["S0963548309009845"],"URL":"https:\/\/doi.org\/10.1017\/s0963548309009845","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7]]}}}