{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T04:53:11Z","timestamp":1789879991452,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540922476","type":"print"},{"value":"9783540922483","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_17","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T13:36:17Z","timestamp":1228397777000},"page":"183-194","source":"Crossref","is-referenced-by-count":11,"title":["Evaluations of Graph Polynomials"],"prefix":"10.1007","author":[{"given":"Benny","family":"Godlin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomer","family":"Kotek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johann A.","family":"Makowsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.jctb.2004.03.003","volume":"92","author":"R. Arratia","year":"2004","unstructured":"Arratia, R., Bollob\u00e1s, B., Sorkin, G.B.: The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B\u00a092, 199\u2013233 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR2","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)","edition":"2"},{"key":"17_CR3","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, Heidelberg (1999)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique\u2013width of graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"17_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.37236\/793","volume":"15","author":"B. Courcelle","year":"2008","unstructured":"Courcelle, B.: A multivariate interlace polynomial and its computation for graphs of bouded clique-width. Electronic Journal of Combinatorics\u00a015(1), R69 (2008)","journal-title":"Electronic Journal of Combinatorics"},{"key":"17_CR6","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"1996","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1996)"},{"issue":"2-3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","volume":"57","author":"K. Edwards","year":"1995","unstructured":"Edwards, K., McDiarmid, C.: The complexity of harmonious colouring for trees. Discrete Appl. Math.\u00a057(2-3), 133\u2013144 (1995)","journal-title":"Discrete Appl. Math."},{"key":"17_CR8","first-page":"37","volume":"20","author":"M. Freedman","year":"2007","unstructured":"Freedman, M., Lov\u00e1sz, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphisms of graphs. Journal of AMS\u00a020, 37\u201351 (2007)","journal-title":"Journal of AMS"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jctb.2005.07.007","volume":"96","author":"A.J. Goodall","year":"2006","unstructured":"Goodall, A.J.: Some new evaluations of the Tutte polynomial. Journal of Combinatorial Theory, Series B\u00a096, 207\u2013224 (2006)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.jctb.2007.09.006","volume":"98","author":"A.J. Goodall","year":"2008","unstructured":"Goodall, A.J.: Parity, eulerian subgraphs and the Tutte polynomial. Journal of Combinatorial Theory, Series B\u00a098(3), 599\u2013628 (2008)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2001)"},{"issue":"1\u20133","key":"17_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J.A. Makowsky","year":"2004","unstructured":"Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic\u00a0126(1\u20133), 159\u2013213 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.dam.2004.01.016","volume":"145","author":"J.A. Makowsky","year":"2005","unstructured":"Makowsky, J.A.: Colored Tutte polynomials and Kauffman brackets on graphs of bounded tree width. Disc. Appl. Math.\u00a0145(2), 276\u2013290 (2005)","journal-title":"Disc. Appl. Math."},{"key":"17_CR14","unstructured":"Makowsky, J.A.: From a zoo to a zoology: Towards a general theory of graph polynomials. Theory of Computing Systems (July 2007), http:\/\/dx.doi.org\/10.1017\/s00224-007-9022-9"},{"key":"17_CR15","unstructured":"Makowsky, J.A., Zilber, B.: Polynomial invariants of graphs and totally categorical theories. MODNET Preprint No. 21 (2006), http:\/\/www.logique.jussieu.fr\/modnet\/Publications\/Preprint%20server"},{"key":"17_CR16","series-title":"London Mathematical Society Lecture Notes Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752506","volume-title":"Complexity: Knots, Colourings and Counting","author":"D.J.A. Welsh","year":"1993","unstructured":"Welsh, D.J.A.: Complexity: Knots, Colourings and Counting. London Mathematical Society Lecture Notes Series, vol.\u00a0186. Cambridge University Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92248-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T20:38:45Z","timestamp":1589315925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}