{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:25:01Z","timestamp":1742955901936,"version":"3.40.3"},"publisher-location":"Boston","reference-count":142,"publisher":"Birkh\u00e4user Boston","isbn-type":[{"type":"print","value":"9780817647889"},{"type":"electronic","value":"9780817647896"}],"license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-8176-4789-6_10","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:42:50Z","timestamp":1287042170000},"page":"257-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Graph Polynomials and Their Applications II: Interrelations and Interpretations"],"prefix":"10.1007","author":[{"given":"Joanna A.","family":"Ellis-Monaghan","sequence":"first","affiliation":[]},{"given":"Criel","family":"Merino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"10_CR1_10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s002080050030","volume":"307","author":"M Aigner","year":"1997","unstructured":"Aigner M (1997) The Penrose polynomial of a plane graph. Ann Math 307:173\u2013189","journal-title":"Ann Math"},{"key":"10_CR2_10","volume-title":"Surveys in combinatorics, 2001","author":"M Aigner","year":"1997","unstructured":"Aigner M (1997) The Penrose polynomial of graphs and matroids. In: Hirschfeld JWP (ed) Surveys in combinatorics, 2001. Cambridge University Press, Cambridge"},{"key":"10_CR3_10","first-page":"43","volume":"102","author":"M Aigner","year":"2000","unstructured":"Aigner M (2000) Die Ideen von Penrose zum 4-Farbenproblem. Jahresber Deutsch Math-Verein 102:43\u201368","journal-title":"Jahresber Deutsch Math-Verein"},{"key":"10_CR4_10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s006050070020","volume":"131","author":"M Aigner","year":"2000","unstructured":"Aigner M, Mielke H (2000) The Penrose polynomial of binary matroids. Monatsh Math 131:1\u201313","journal-title":"Monatsh Math"},{"key":"10_CR5_10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.laa.2003.06.010","volume":"377","author":"M Aigner","year":"2004","unstructured":"Aigner M, van der Holst H (2004) Interlace polynomials. Lin Algebra Appl 377:11\u201330","journal-title":"Lin Algebra Appl"},{"key":"10_CR6_10","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1021\/ja00426a013","volume":"98","author":"J Aihara","year":"1976","unstructured":"Aihara J (1976) A new definition of Dewar-type resonance energies. J Am Chem Soc 98:2750\u20132758","journal-title":"J Am Chem Soc"},{"key":"10_CR7_10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01212973","volume":"14","author":"L Allys","year":"1994","unstructured":"Allys L (1994) Minimally 3-connected isotropic systems. Combinatorica 14:247\u2013262","journal-title":"Combinatorica"},{"key":"10_CR8_10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon N, Tarsi M (1992) Colorings and orientations of graphs. Combinatorica 12:125\u2013134","journal-title":"Combinatorica"},{"key":"10_CR9_10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1089\/cmb.1996.3.425","volume":"3","author":"R Arratia","year":"1996","unstructured":"Arratia R, Martin D, Reinert G, Waterman M (1996) Poisson process approximation for sequence by hybridization. J Comput Biol 3:425\u2013463","journal-title":"J Comput Biol"},{"key":"10_CR10_10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0166-218X(00)00190-6","volume":"104","author":"R Arratia","year":"2000","unstructured":"Arratia R, Bollob\u00e1s B, Coppersmith D, Sorkin G (2000) Euler circuits and DNA sequencing by hybridization, combinatorial molecular biology. Discrete Appl Math 104:63\u201396","journal-title":"Discrete Appl Math"},{"key":"10_CR11_10","unstructured":"Arratia R, Bollob\u00e1s B, Sorkin G (2000) The interlace polynomial: a new graph polynomial. In: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms. San Francisco, CA"},{"key":"10_CR12_10","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00493-004-0035-6","volume":"24","author":"R Arratia","year":"2004","unstructured":"Arratia R, Bollob\u00e1s B, Sorkin G (2004) A two-variable interlace polynomial. Combinatorica 24:567\u2013584","journal-title":"Combinatorica"},{"key":"10_CR13_10","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 (2004) The interlace polynomial of a graph. J Combin Theory B 92:199\u2013233","journal-title":"J Combin Theory B"},{"key":"10_CR14_10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/eujc.2000.0434","volume":"22","author":"PN Balister","year":"2001","unstructured":"Balister PN, Bollob\u00e1s B, Riordan OM, Scott AD (2001) Alternating knot diagrams, Euler circuits and the interlace polynomial. Eur J Combinator 22:1\u20134","journal-title":"Eur J Combinator"},{"key":"10_CR15_10","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1006\/eujc.2002.0602","volume":"23","author":"PN Balister","year":"2002","unstructured":"Balister PN, Bollob\u00e1s B, Cutler J, Pebody L (2002) The interlace polynomial of graphs at \u2212 1. Eur J Combinator 23:761\u2013767","journal-title":"Eur J Combinator"},{"key":"10_CR16_10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02574364","volume":"12","author":"AI Barvinok","year":"1994","unstructured":"Barvinok AI (1994) Computing the Ehrhart polynomial of a convex lattice polytope. Discrete Comput Geom 12:35\u201348","journal-title":"Discrete Comput Geom"},{"key":"10_CR17_10","unstructured":"Beaudin L, Ellis-Monaghan JA, Pangborn G, Shrock R. A little statistical mechanics for the graph theorist, preprint, arXiv:0804.2468"},{"key":"10_CR18_10","volume-title":"Computing the continuous discretely: integer-point enumeration in polyhedra","author":"M Beck","year":"2007","unstructured":"Beck M, Robins S (2007) Computing the continuous discretely: integer-point enumeration in polyhedra. Springer, New York"},{"key":"10_CR19_10","first-page":"202","volume":"358","author":"U Betke","year":"1985","unstructured":"Betke U, Kneser M (1985) Zerlegungen und Bewertungen von Gitterpolytopen. J Reine Angew Math 358:202\u2013208","journal-title":"J Reine Angew Math"},{"key":"10_CR20_10","volume-title":"Algebraic graph theory","author":"N Biggs","year":"1996","unstructured":"Biggs N (1996) Algebraic graph theory, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"key":"10_CR21_10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Modern graph theory. Graduate text in mathematics. Springer, Berlin, New York"},{"key":"10_CR22_10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1006\/jctb.2001.2102","volume":"85","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s B (2002) Evaluations of the circuit partition polynomial. J Combin Theory B 85:261\u2013268","journal-title":"J Combin Theory B"},{"key":"10_CR23_10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0963548398003447","volume":"8","author":"B Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s B, Riordan O (1999) A Tutte polynomial for coloured graphs. Combinator Probab Comput 8:45\u201393","journal-title":"Combinator Probab Comput"},{"key":"10_CR24_10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1112\/plms\/83.3.513","volume":"83","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B, Riordan O (2001) A polynomial invariant of graphs on orientable surfaces. Proc Lond Math Soc 83:513\u2013531","journal-title":"Proc Lond Math Soc"},{"key":"10_CR25_10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s002080100297","volume":"323","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s B, Riordan O (2002) A polynomial of graphs on surfaces. Ann Math 323:81\u201396","journal-title":"Ann Math"},{"key":"10_CR26_10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0195-6698(87)80027-6","volume":"8","author":"A Bouchet","year":"1987","unstructured":"Bouchet A (1987) Isotropic systems. Eur J Combinator 8:231\u2013244","journal-title":"Eur J Combinator"},{"key":"10_CR27_10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02579301","volume":"7","author":"A Bouchet","year":"1987","unstructured":"Bouchet A (1987) Reducing prime graphs and recognizing circle graphs. Combinatorica 7:243\u2013254","journal-title":"Combinatorica"},{"key":"10_CR28_10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0012-365X(87)90132-4","volume":"66","author":"A Bouchet","year":"1987","unstructured":"Bouchet A (1987) Unimodularity and circle graphs. Discrete Math 66:203\u2013208","journal-title":"Discrete Math"},{"key":"10_CR29_10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0095-8956(88)90055-X","volume":"45","author":"A Bouchet","year":"1988","unstructured":"Bouchet A (1988) Graphic presentations of isotropic systems. J Combin Theory B 45:58\u201376","journal-title":"J Combin Theory B"},{"key":"10_CR30_10","doi-asserted-by":"crossref","unstructured":"Bouchet A (1989) Connectivity of isotropic systems. (J Combin Math, Proceedings of the 3rd international conference, New York, 1985) Ann N Y Acad Sci 555:81\u201393","DOI":"10.1111\/j.1749-6632.1989.tb22439.x"},{"key":"10_CR31_10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF01787630","volume":"7","author":"A Bouchet","year":"1991","unstructured":"Bouchet A (1991) Tutte\u2013Martin polynomials and orienting vectors of isotropic systems. Graph Combinator 7:235\u2013252","journal-title":"Graph Combinator"},{"key":"10_CR32_10","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1006\/eujc.1993.1054","volume":"14","author":"A Bouchet","year":"1993","unstructured":"Bouchet A (1993) Compatible Euler tours and supplementary Eulerian vectors. Eur J Combinator 14:513\u2013520","journal-title":"Eur J Combinator"},{"key":"10_CR33_10","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/S0895480193242591","volume":"10","author":"A Bouchet","year":"1997","unstructured":"Bouchet A (1997) Multimatroids. I. Coverings by independent sets. SIAM J Discrete Math 10:626\u2013646","journal-title":"I. Coverings by independent sets. SIAM J Discrete Math"},{"key":"10_CR34_10","doi-asserted-by":"crossref","unstructured":"Bouchet A (1998) Multimatroids. II. Orthogonality, minors and connectivity. Electron J Combinator 5","DOI":"10.37236\/1346"},{"key":"10_CR35_10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0024-3795(97)10041-6","volume":"277","author":"A Bouchet","year":"1998","unstructured":"Bouchet A (1998) Multimatroids. IV. Chain-group representations. Lin Algebra Appl 277:271\u2013289","journal-title":"IV. Chain-group representations. Lin Algebra Appl"},{"key":"10_CR36_10","first-page":"657","volume":"22","author":"A Bouchet","year":"2001","unstructured":"Bouchet A (2001) Multimatroids. III. Tightness and fundamental graphs. Eur J Combinator 22:657\u2013677","journal-title":"III. Tightness and fundamental graphs. Eur J Combinator"},{"key":"10_CR37_10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2004.07.028","volume":"302","author":"A Bouchet","year":"2005","unstructured":"Bouchet A (2005) Graph polynomials derived from Tutte\u2013Martin polynomials. Discrete Math 302:32\u201338","journal-title":"Discrete Math"},{"key":"10_CR38_10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0012-365X(95)00219-M","volume":"161","author":"A Bouchet","year":"1996","unstructured":"Bouchet A, Ghier L (1996) Connectivity and \u03b2 invariants of isotropic systems and 4-regular graphs. Discrete Math 161:25\u201344","journal-title":"Discrete Math"},{"key":"10_CR39_10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0095-8956(81)90068-X","volume":"30","author":"TH Brylawski","year":"1981","unstructured":"Brylawski TH (1981) Intersection theory for graphs. J Combin Theory B 30:233\u2013246","journal-title":"J Combin Theory B"},{"key":"10_CR40_10","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.jctb.2008.09.007","volume":"99","author":"S Chmutov","year":"2009","unstructured":"Chmutov S (2009) Generalized duality for graphs on surfaces and the signed Bollob\u00e1s-Riordan polynomial. J Combin Theory B 99:617\u2013638","journal-title":"J Combin Theory B"},{"issue":"409\u2013418","key":"10_CR41_10","first-page":"573","volume":"7","author":"S Chmutov","year":"2007","unstructured":"Chmutov S, Pak I (2007) The Kauffman bracket of virtual links and the Bollob\u00e1s-Riordan polynomial. Mosc Math J 7:409\u2013418, 573","journal-title":"Mosc Math J"},{"key":"10_CR42_10","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0196-8858(03)00078-2","volume":"32","author":"Y-B Choe","year":"2004","unstructured":"Choe Y-B, Oxley J, Sokal A, Wagner D (2004) Homogeneous multivariate polynomials with the half-plane property. Adv Appl Math 32:88\u2013187","journal-title":"Adv Appl Math"},{"key":"10_CR43_10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/aima.1996.0018","volume":"118","author":"T Chow","year":"1996","unstructured":"Chow T (1996) The path-cycle symmetric function of a digraph. Adv Math 118:71\u201398","journal-title":"Adv Math"},{"key":"10_CR44_10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jctb.1995.1055","volume":"65","author":"FRK Chung","year":"1995","unstructured":"Chung FRK, Graham RL (1995) On the cover polynomial of a digraph. J Combin Theory B 65:273\u2013290","journal-title":"J Combin Theory B"},{"issue":"1","key":"10_CR45_10","doi-asserted-by":"crossref","first-page":"R69","DOI":"10.37236\/793","volume":"15","author":"B Courcelle","year":"2008","unstructured":"Courcelle B (2008) A multivariate interlace polynomial and its computation for graphs of bounded clique-width. Electron J Combinator 15(1):R69","journal-title":"Electron J Combinator"},{"key":"10_CR46_10","volume-title":"Spectra of graphs: theory and applications","author":"DM Cvetkovi\u0107","year":"1980","unstructured":"Cvetkovi\u0107 DM, Doob M, Sachs H (1980) Spectra of graphs: theory and applications. Academic, New York"},{"key":"10_CR47_10","first-page":"91","volume":"116","author":"DM Cvetkovi\u0107","year":"1998","unstructured":"Cvetkovi\u0107 DM, Lepovi\u0107 M (1998) Seeking counterexamples to the reconstruction conjecture for characteristic polynomials of graphs and a positive result. Bull Acad Serbe Sci Arts, Cl Sci Math Natur, Sci Math 116:91\u2013100","journal-title":"Bull Acad Serbe Sci Arts, Cl Sci Math Natur, Sci Math"},{"key":"10_CR48_10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.2307\/2951842","volume":"145","author":"R Diaz","year":"1997","unstructured":"Diaz R, Robins S (1997) The Ehrhart polynomial of a lattice polytope. Ann Math 145: 503\u2013518","journal-title":"Ann Math"},{"key":"10_CR49_10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1089\/cmb.1994.1.105","volume":"1","author":"M Dyer","year":"1994","unstructured":"Dyer M, Frieze A, Suen S (1994) The probability of unique solutions of sequencing by hybridization. J Comput Biol 1:105\u2013110","journal-title":"J Comput Biol"},{"key":"10_CR50_10","unstructured":"Ehrhart E (1967) D\u00e9monstration de la loi de r\u00e9ciprocit\u00e9 du poly\u00e8dre rationnel. C R Acad Sci Paris S\u00e9r A\u2013B 265:A91\u2013A94"},{"key":"10_CR51_10","first-page":"1","volume":"226","author":"E Ehrhart","year":"1967","unstructured":"Ehrhart E (1967) Sur un probl\u00e8me de g\u00e9ometrie diophantienne lin\u00e9aire I. J Reine Angew Math 226:1\u201329","journal-title":"J Reine Angew Math"},{"key":"10_CR52_10","first-page":"25","volume":"227","author":"E Ehrhart","year":"1967","unstructured":"Ehrhart E (1967) Sur un probl\u00e8me de g\u00e9ometrie diophantienne lin\u00e9aire II. J Reine Angew Math 227:25\u201349","journal-title":"J Reine Angew Math"},{"key":"10_CR53_10","unstructured":"Ehrhart E (1977) Polyn\u00f4mes Arithm\u00e9tiques et M\u00e9thode des Poly\u00e8dres en Combinatoire. International Series of Numerical Mathematics vol 35. Birkh\u00e4user, Basel-Stuttgart"},{"key":"10_CR54_10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF01261320","volume":"16","author":"MN Ellingham","year":"1996","unstructured":"Ellingham MN, Goddyn L (1996) List edge colourings of some 1-factorable multigraphs. Combinatorica 16:343\u2013352","journal-title":"Combinatorica"},{"key":"10_CR55_10","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1006\/jctb.1998.1853","volume":"74","author":"JA Ellis-Monaghan","year":"1998","unstructured":"Ellis-Monaghan JA (1998) New results for the Martin polynomial. J Combin Theory B 74:326\u2013352","journal-title":"J Combin Theory B"},{"key":"10_CR56_10","first-page":"173","volume":"142","author":"JA Ellis-Monaghan","year":"2000","unstructured":"Ellis-Monaghan JA (2000) Differentiating the Martin polynomial. Cong Numer 142:173\u2013183","journal-title":"Cong Numer"},{"key":"10_CR57_10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.disc.2003.10.018","volume":"281","author":"JA Ellis-Monaghan","year":"2004","unstructured":"Ellis-Monaghan JA (2004) Exploring the Tutte\u2013Martin connection. Discrete Math 281: 173\u2013187","journal-title":"Discrete Math"},{"key":"10_CR58_10","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0196-8858(03)00079-4","volume":"32","author":"JA Ellis-Monaghan","year":"2004","unstructured":"Ellis-Monaghan JA (2004) Identities for circuit partition polynomials, with applications to the Tutte polynomial. Adv Appl Math 32:188\u2013197","journal-title":"Adv Appl Math"},{"key":"10_CR59_10","unstructured":"Ellis-Monaghan JA, Moffatt I. Twisted duality and polynomials of embedded graphs, preprint arXiv:0906.5557"},{"key":"10_CR60_10","unstructured":"Ellis-Monaghan JA, Sarmiento I. A recipe theorem for the topological Tutte polynomial of Bollob\u00e1s and Riordan, preprint arXiv:0903.2643"},{"key":"10_CR61_10","first-page":"211","volume":"150","author":"JA Ellis-Monaghan","year":"2001","unstructured":"Ellis-Monaghan JA, Sarmiento I (2001) Medial graphs and the Penrose polynomial. Congr Numer 150:211\u2013222","journal-title":"Congr Numer"},{"key":"10_CR62_10","first-page":"57","volume":"155","author":"JA Ellis-Monaghan","year":"2002","unstructured":"Ellis-Monaghan JA, Sarmiento I (2002) Generalized transition polynomials. Congr Numer 155:57\u201369","journal-title":"Congr Numer"},{"key":"10_CR63_10","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1017\/S0963548307008723","volume":"16","author":"JA Ellis-Monaghan","year":"2007","unstructured":"Ellis-Monaghan JA, Sarmiento I (2007) Distance hereditary graphs and the interlace polynomial. Combinator Probab Comput 16:947\u2013973","journal-title":"Combinator Probab Comput"},{"key":"10_CR64_10","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1017\/S0963548306007656","volume":"15","author":"JA Ellis-Monaghan","year":"2006","unstructured":"Ellis-Monaghan JA, Traldi L (2006) Parametrized Tutte polynomials of graphs and matroids. Combinator Probab Comput 15:835\u2013834","journal-title":"Combinator Probab Comput"},{"issue":"8","key":"10_CR65_10","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1089\/cmb.2006.13.1503","volume":"13","author":"F Emmert-Streib","year":"2006","unstructured":"Emmert-Streib F (2006) Algorithmic computation of knot polynomials of secondary structure elements of proteins. J Comput Biol 13(8):1503\u20131512","journal-title":"J Comput Biol"},{"key":"10_CR66_10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0095-8956(79)90070-4","volume":"27","author":"EJ Farrell","year":"1979","unstructured":"Farrell EJ (1979) An introduction to matching polynomials. J Combin Theory B 27:75\u201386","journal-title":"J Combin Theory B"},{"key":"10_CR67_10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0012-365X(79)90014-1","volume":"25","author":"EJ Farrell","year":"1979","unstructured":"Farrell EJ (1979) On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs. Discrete Math 25:121\u2013133","journal-title":"Discrete Math"},{"key":"10_CR68_10","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/0016-0032(88)90060-9","volume":"325","author":"EJ Farrell","year":"1988","unstructured":"Farrell EJ (1988) On the matching polynomial and its relation to the rook polynomial. J Franklin Inst 325:527\u2013543","journal-title":"J Franklin Inst"},{"key":"10_CR69_10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0167-5060(08)70386-8","volume":"55","author":"EJ Farrell","year":"1993","unstructured":"Farrell EJ (1993) The impact of F-polynomials in graph theory, Quo vadis, graph theory? Ann Discrete Math, North-Holland, Amsterdam, 55:173\u2013178","journal-title":"Ann Discrete Math, North-Holland, Amsterdam"},{"issue":"1","key":"10_CR70_10","doi-asserted-by":"crossref","first-page":"R21","DOI":"10.37236\/1306","volume":"4","author":"MA Fiol","year":"1997","unstructured":"Fiol MA (1997) Some applications of the proper and adjacency polynomials in the theory of graph spectra. Electron J Combinator 4(1):R21","journal-title":"Electron J Combinator"},{"key":"10_CR71_10","volume-title":"Eulerian graphs and related topics, part 1","author":"H Fleischner","year":"1991","unstructured":"Fleischner H (1991) Eulerian graphs and related topics, part 1, vol 2, p 50. Ann Discrete Math, North-Holland Publishing Co., Amsterdam"},{"key":"10_CR72_10","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/0031-8914(72)90045-6","volume":"57","author":"CM Fortuin","year":"1972","unstructured":"Fortuin CM, Kasteleyn PW (1972) On the random cluster model. Physica 57:536\u2013564","journal-title":"Physica"},{"key":"10_CR73_10","doi-asserted-by":"publisher","first-page":"3253","DOI":"10.1016\/j.disc.2006.06.003","volume":"306","author":"R Glantz","year":"2006","unstructured":"Glantz R, Pelillo M (2006) Graph polynomials from principal pivoting. Discrete Math 306:3253\u20133266","journal-title":"Discrete Math"},{"key":"10_CR74_10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/jgt.3190050310","volume":"5","author":"CD Godsil","year":"1981","unstructured":"Godsil CD (1981) Matchings and walks in graphs. J Graph Theory 5:285\u2013297","journal-title":"J Graph Theory"},{"key":"10_CR75_10","volume-title":"Progress in graph theory","author":"CD Godsil","year":"1984","unstructured":"Godsil CD (1984) Real graph polynomials. In: Bondy JA, Murty USR (eds) Progress in graph theory. Academic, Toronto"},{"key":"10_CR76_10","volume-title":"Algebraic combinatorics","author":"CD Godsil","year":"1993","unstructured":"Godsil CD (1993) Algebraic combinatorics. Chapman & Hall, New York"},{"key":"10_CR77_10","volume-title":"Handbook of combinatorics, vol 2","author":"CD Godsil","year":"1995","unstructured":"Godsil CD (1995) Tools from linear algebra. In: Graham RL, Gr\u00f6tschel M, Lov\u00e1sz L (eds) Handbook of combinatorics, vol 2. Elsevier, Amsterdam"},{"key":"10_CR78_10","volume-title":"Chemical graph theory: introduction and fundamentals","author":"I Gutman","year":"1991","unstructured":"Gutman I (1991) Polynomials in graph theory. In: Bonchev D, Rouvray DH (eds) Chemical graph theory: introduction and fundamentals. Abacus Press, New York"},{"key":"10_CR79_10","first-page":"45","volume":"488\u2013541","author":"I Gutman","year":"1975","unstructured":"Gutman I, Cvetkovi\u0107 DM (1975) The reconstruction problem for the characteristic polynomial of graphs. Publ Electrotehn Fac Ser Fiz 488\u2013541:45\u201348","journal-title":"Publ Electrotehn Fac Ser Fiz"},{"key":"10_CR80_10","first-page":"87","volume":"48","author":"I Gutman","year":"1976","unstructured":"Gutman I, Milun M, Trinajsti\u0107 N (1976) Graph theory and molecular orbitals. XVIII. On topological resonance energy. Croat Chem Acta 48:87\u201395","journal-title":"XVIII. On topological resonance energy. Croat Chem Acta"},{"key":"10_CR81_10","doi-asserted-by":"publisher","first-page":"1692","DOI":"10.1021\/ja00448a002","volume":"99","author":"I Gutman","year":"1977","unstructured":"Gutman I, Milun M, Trinajsti\u0107 N (1977) Graph theory and molecular orbitals. 19. Nonparametric resonance energies of arbitrary conjugated systems. J Am Chem Soc 99:1692\u20131704","journal-title":"J Am Chem Soc"},{"key":"10_CR82_10","first-page":"203","volume":"91","author":"I Gutman","year":"1976","unstructured":"Gutman I, Trinajsti\u0107 N (1976) Graph theory and molecular orbitals, XIV. On topological definition of resonance energy. Acta Chim Acad Sci Hung 91:203\u2013209","journal-title":"XIV. On topological definition of resonance energy. Acta Chim Acad Sci Hung"},{"key":"10_CR83_10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/1004057","volume":"4","author":"F Harary","year":"1962","unstructured":"Harary F (1962) The determinant of the adjacency matrix of a graph. SIAM Rev 4:202\u2013210","journal-title":"SIAM Rev"},{"key":"10_CR84_10","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1103\/PhysRevLett.24.1412","volume":"24","author":"OJ Heilmann","year":"1970","unstructured":"Heilmann OJ, Lieb EH (1970) Monomers and dimers. Phys Rev Lett 24:1412\u20131414","journal-title":"Phys Rev Lett"},{"key":"10_CR85_10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF01877590","volume":"25","author":"OJ Heilmann","year":"1972","unstructured":"Heilmann OJ, Lieb EH (1972) Theory of monomer-dimer systems. Commun Math Phys 25:190\u2013232","journal-title":"Commun Math Phys"},{"key":"10_CR86_10","volume-title":"Matrix analysis","author":"RA Horn","year":"1990","unstructured":"Horn RA, Johnson CR (1990) Matrix analysis. Cambridge University Press, Cambridge"},{"key":"10_CR87_10","first-page":"2332","volume":"44","author":"H Hosaya","year":"1971","unstructured":"Hosaya H (1971) Topological Index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bull Chem Soc Jpn 44:2332\u20132339","journal-title":"A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons. Bull Chem Soc Jpn"},{"key":"10_CR88_10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0095-8956(91)90055-O","volume":"53","author":"B Jackson","year":"1991","unstructured":"Jackson B (1991) Supplementary Eulerian vectors in isotropic systems. J Combin Theory B 53:93\u2013105","journal-title":"J Combin Theory B"},{"issue":"2","key":"10_CR89_10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0002-9939-1988-0943099-0","volume":"103","author":"F Jaeger","year":"1988","unstructured":"Jaeger F (1988) Tutte polynomials and link polynomials. Proc Am Math Soc 103(2):647\u2013654","journal-title":"Proc Am Math Soc"},{"key":"10_CR90_10","doi-asserted-by":"crossref","unstructured":"Jaeger F (1990) On Transition polynomials of 4-regular graphs, cycles and rays. NATO Adv Sci Inst Ser C: Math Phys Sci 301. Kluwer, Dordrecht","DOI":"10.1007\/978-94-009-0517-7_12"},{"key":"10_CR91_10","first-page":"501","volume":"317","author":"JM Kantor","year":"1993","unstructured":"Kantor JM, Khovanskii A (1993) Une application du Th\u00e9or\u00e8me de Riemann-Roch combinatoire au polyn\u00f4me d\u2019Ehrhart des polytopes entier de \n$${\\mathbb{R}}^{d}$$\n. C R Acad Sci Paris Ser I 317:501\u2013507","journal-title":"C R Acad Sci Paris Ser I"},{"key":"10_CR92_10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0166-218X(89)90049-8","volume":"25","author":"LH Kauffman","year":"1989","unstructured":"Kauffman LH (1989) A Tutte polynomial for signed graphs. Discrete Appl Math 25:105\u2013127","journal-title":"Discrete Appl Math"},{"key":"10_CR93_10","doi-asserted-by":"crossref","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly PJ (1957) A congruence theorem for trees. Pac J Math 7:961\u2013968","journal-title":"Pac J Math"},{"key":"10_CR94_10","unstructured":"Kel\u2019mans AK (1965) The number of trees in a graph. I. Automat i Telemeh 26:2194\u20132204 (1965) (in Russian); transl. Autom Rem Contr 26:2118\u20132129"},{"key":"10_CR95_10","first-page":"109","volume":"31","author":"WL Kocay","year":"1981","unstructured":"Kocay WL (1981) An extension of Kelly\u2019s lemma to spanning subgraphs. Congr Numer 31:109\u2013120","journal-title":"Congr Numer"},{"key":"10_CR96_10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0375-9601(70)90520-7","volume":"32","author":"H Kunz","year":"1970","unstructured":"Kunz H (1970) Location of the zeros of the partition function for some classical lattice systems. Phys Lett A 32:311\u2013312","journal-title":"Phys Lett A"},{"key":"10_CR97_10","volume-title":"Graph theory and combinatorics","author":"M Las Vergnas","year":"1979","unstructured":"Las Vergnas M (1979) On Eulerian partitions of graphs. In: Wilson RJ (ed) Graph theory and combinatorics. Pitman, Boston London"},{"key":"10_CR98_10","volume-title":"Combinatorial mathematics","author":"M Las Vergnas","year":"1983","unstructured":"Las Vergnas M (1983) Le polyn\u00f4me de Martin d\u2019un graphe eul\u00e9rien. In: Berge C, Bresson D, Camion P, Maurras J-F, Sterboul F (eds) Combinatorial mathematics. North-Holland, Amsterdam"},{"key":"10_CR99_10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0095-8956(88)90079-2","volume":"44","author":"M Las Vergnas","year":"1988","unstructured":"Las Vergnas M (1988) On the evaluation at (3,3) of the Tutte polynomial of a graph. J Combin Theory B 44:367\u2013372","journal-title":"J Combin Theory B"},{"key":"10_CR100_10","volume-title":"Proceedings of the 1st international conference on algebraic informatics","author":"VE Levit","year":"2005","unstructured":"Levit VE, Mandrescu E (2005) The independence polynomial of a graph \u2013 a survey. In: Bozapalidis S, Kalampakas A, Rahonis G (eds) Proceedings of the 1st international conference on algebraic informatics. Aristotle University of Thessaloniki, Thessaloniki"},{"key":"10_CR101_10","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. Ann Discrete Math 29, Amsterdam"},{"key":"10_CR102_10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1112\/jlms\/s2-4.1.181","volume":"4","author":"IG Macdonald","year":"1971","unstructured":"Macdonald IG (1971) Polynomials associated with finite cell complexes. J Lond Math Soc 4:181\u2013192","journal-title":"J Lond Math Soc"},{"key":"10_CR103_10","volume-title":"Enum\u00e9rations eul\u00e9riennes dans le multigraphs et invariants de Tutte\u2013Grothendieck","author":"P Martin","year":"1977","unstructured":"Martin P (1977) Enum\u00e9rations eul\u00e9riennes dans le multigraphs et invariants de Tutte\u2013Grothendieck. Thesis, Grenoble"},{"key":"10_CR104_10","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/0095-8956(78)90050-3","volume":"24","author":"P Martin","year":"1978","unstructured":"Martin P (1978) Remarkable valuation of the dichromatic polynomial of planar multigraphs. J Combin Theory B 24:318\u2013324","journal-title":"J Combin Theory B"},{"key":"10_CR105_10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1090\/S0002-9947-1971-0279689-2","volume":"159","author":"P McMullen","year":"1971","unstructured":"McMullen P (1971) On zonotopes. Trans Am Math Soc 159:91\u2013109","journal-title":"Trans Am Math Soc"},{"key":"10_CR106_10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1017\/S0963548309009845","volume":"18","author":"C Merino","year":"2009","unstructured":"Merino C, Noble SD (2009) The equivalence of two graph polynomials and a symmetric function. Combinator Probab Comput 18:601\u2013615","journal-title":"Combinator Probab Comput"},{"key":"10_CR107_10","unstructured":"Moffatt I (2010) Unsigned state models for the Jones polynomial. Ann Combinator (to appear)."},{"key":"10_CR108_10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ejc.2006.12.004","volume":"29","author":"I Moffatt","year":"2008","unstructured":"Moffatt I (2008) Knot invariants and the Bollob\u00e1s-Riordan Polynomial of embedded graphs. Eur J Combinator 29:95\u2013107","journal-title":"Eur J Combinator"},{"key":"10_CR109_10","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.5802\/aif.1706","volume":"49","author":"SD Noble","year":"1999","unstructured":"Noble SD, Welsh DJA (1999) A weighted graph polynomial from chromatic invariants of knots. Annales de l\u2019institute Fourier 49:1057\u20131087","journal-title":"Annales de l\u2019institute Fourier"},{"key":"10_CR110_10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(03)00225-1","volume":"307","author":"M Noy","year":"2003","unstructured":"Noy M (2003) Graphs determined by polynomial invariants. Theor Comput Sci 307:365\u2013384","journal-title":"Theor Comput Sci"},{"key":"10_CR111_10","volume-title":"Recent studies in graph theory","author":"KR Pathasarthy","year":"1989","unstructured":"Pathasarthy KR (1989) Graph polynomials. In: Kulli VR (ed) Recent studies in graph theory. Vishwa International Publications, Gulbarga"},{"key":"10_CR112_10","volume-title":"Combinatorial mathematics and its applications: Proceedings of a conference held at the mathematical institute, Oxford, 1969","author":"R Penrose","year":"1971","unstructured":"Penrose R (1971) Applications of negative dimensional tensors. In: Welsh DJA (ed) Combinatorial mathematics and its applications: Proceedings of a conference held at the mathematical institute, Oxford, 1969. Academic, London\/New York"},{"key":"10_CR113_10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J Peterson","year":"1891","unstructured":"Peterson J (1891) Die theorie der regularen graphs. Acta Math 15:193\u2013220","journal-title":"Acta Math"},{"key":"10_CR114_10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"PA Pevzner","year":"1989","unstructured":"Pevzner PA (1989) l-tuple DNA sequencing: computer analysis. J Biomol Struct Dynam 7:63\u201373","journal-title":"J Biomol Struct Dynam"},{"key":"10_CR115_10","first-page":"23","volume":"65","author":"H Poincar\u00e9","year":"1901","unstructured":"Poincar\u00e9 H (1901) Second compl\u00e9ment \u00e0 l\u2019analysis situs. Proc Lond Math Soc 65:23\u201345","journal-title":"Proc Lond Math Soc"},{"key":"10_CR116_10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01444874","volume":"295","author":"J Pommersheim","year":"1993","unstructured":"Pommersheim J (1993) Toric varieties, lattice points, and Dedekind sums. Ann Math 295: 1\u201324","journal-title":"Ann Math"},{"key":"10_CR117_10","volume-title":"An introduction to combinatorial analysis","author":"J Riordan","year":"1958","unstructured":"Riordan J (1958) An introduction to combinatorial analysis. Wiley, New York"},{"key":"10_CR118_10","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jctb.2004.03.008","volume":"91","author":"G Royle","year":"2004","unstructured":"Royle G, Sokal A (2004) The Brown\u2013Colbourn conjecture on zeros of reliability polynomials is false. J Combin Theory B 91:345\u2013360","journal-title":"J Combin Theory B"},{"key":"10_CR119_10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s000260050008","volume":"4","author":"I Sarmiento","year":"2000","unstructured":"Sarmiento I (2000) The polychromate and a chord diagram polynomial. Ann Combinator 4:227\u2013236","journal-title":"Ann Combinator"},{"key":"10_CR120_10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1006\/eujc.2001.0535","volume":"22","author":"I Sarmiento","year":"2001","unstructured":"Sarmiento I (2001) Hopf algebras and the Penrose polynomial. Eur J Combinator 22: 1149\u20131158","journal-title":"Eur J Combinator"},{"key":"10_CR121_10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.4153\/CJM-1974-032-5","volume":"26","author":"GC Shephard","year":"1974","unstructured":"Shephard GC (1974) Combinatorial properties of associated zonotopes. Can J Math 26: 302\u2013321","journal-title":"Can J Math"},{"key":"10_CR122_10","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/S0378-4371(99)00519-1","volume":"279","author":"AD Sokal","year":"2000","unstructured":"Sokal AD (2000) Chromatic polynomials, Potts models and all that. Physica A 279:324\u2013332","journal-title":"Physica A"},{"key":"10_CR123_10","first-page":"21","volume":"7","author":"AD Sokal","year":"2001","unstructured":"Sokal AD (2001) A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models. Markov Process Relat Fields 7:21\u201338","journal-title":"Markov Process Relat Fields"},{"key":"10_CR124_10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S0963548300004612","volume":"10","author":"AD Sokal","year":"2001","unstructured":"Sokal AD (2001) Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions. Combinator Probab Comput 10:41\u201377","journal-title":"Combinator Probab Comput"},{"key":"10_CR125_10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0167-5060(08)70717-9","volume":"6","author":"RP Stanley","year":"1980","unstructured":"Stanley RP (1980) Decompositions of rational convex polytopes. Ann Discrete Math 6:333\u2013342","journal-title":"Ann Discrete Math"},{"key":"10_CR126_10","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/aima.1995.1020","volume":"111","author":"RP Stanley","year":"1995","unstructured":"Stanley RP (1995) A symmetric function generalization of the chromatic polynomial of a graph. Adv Math 111:166\u2013194","journal-title":"Adv Math"},{"key":"10_CR127_10","volume-title":"Enumerative combinatorics","author":"RP Stanley","year":"1996","unstructured":"Stanley RP (1996) Enumerative combinatorics, vol 1. Cambridge University Press, Cambridge"},{"key":"10_CR128_10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0012-365X(98)00146-0","volume":"193","author":"RP Stanley","year":"1998","unstructured":"Stanley RP (1998) Graph colourings and related symmetric functions: ideas and applications. A description of results, interesting applications, and notable open problems. Discrete Math 193:267\u2013286","journal-title":"Discrete Math"},{"key":"10_CR129_10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.2307\/2369436","volume":"1","author":"JJ Sylvester","year":"1878","unstructured":"Sylvester JJ (1878) On an application of the new atomic theory to the graphical representation of the invariants and covariants of binary quantics, with three appendices. Am J Math 1:64\u2013125","journal-title":"Am J Math"},{"key":"10_CR130_10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0040-9383(87)90003-6","volume":"26","author":"MB Thistlethwaite","year":"1987","unstructured":"Thistlethwaite MB (1987) A spanning tree expansion of the Jones polynomial. Topology 26:297\u2013309","journal-title":"Topology"},{"key":"10_CR131_10","unstructured":"Traldi L. Weighted interlace polynomials, preprint, arXiv:0808.1888v4"},{"key":"10_CR132_10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0021-9800(67)80032-2","volume":"2","author":"WT Tutte","year":"1967","unstructured":"Tutte WT (1967) On dichromatic polynomials. J Combin Theory 2:301\u2013320","journal-title":"J Combin Theory"},{"key":"10_CR133_10","volume-title":"Graph theory and related topics","author":"WT Tutte","year":"1979","unstructured":"Tutte WT (1979) All the kings horses. In: Bondy JA, Murty USR (eds) Graph theory and related topics. Academic, London"},{"key":"10_CR134_10","volume-title":"Graph theory","author":"WT Tutte","year":"1984","unstructured":"Tutte WT (1984) Graph theory. Addison-Wesley, New York"},{"key":"10_CR135_10","volume-title":"A collection of mathematical problems","author":"S Ulam","year":"1960","unstructured":"Ulam S (1960) A collection of mathematical problems. Wiley, New York"},{"key":"10_CR136_10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to computational biology: maps, sequences and genomes","author":"MS Waterman","year":"1995","unstructured":"Waterman MS (1995) Introduction to computational biology: maps, sequences and genomes. Chapman & Hall, New York"},{"key":"10_CR137_10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511752506","volume-title":"Complexity: knots, colorings and counting","author":"DJA Welsh","year":"1993","unstructured":"Welsh DJA (1993) Complexity: knots, colorings and counting. Cambridge University Press, Cambridge"},{"key":"10_CR138_10","volume-title":"Surveys in Combinatorics, 1997","author":"DJA Welsh","year":"1997","unstructured":"Welsh DJA (1997) Approximate counting. In: Bailey R (ed) Surveys in Combinatorics, 1997. Cambridge University Press, Cambridge"},{"key":"10_CR139_10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<210::AID-RSA2>3.0.CO;2-R","volume":"15","author":"DJA Welsh","year":"1999","unstructured":"Welsh DJA (1999) The Tutte polynomial. Statistical physics methods in discrete probability, combinatorics, and theoretical computer science. Random Struct Algorithm 15:210\u2013228","journal-title":"Random Struct Algorithm"},{"key":"10_CR140_10","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1063\/1.533181","volume":"41","author":"DJA Welsh","year":"2000","unstructured":"Welsh DJA, Merino C (2000) The Potts model and the Tutte polynomial. J Math Phys 41:1127\u20131152","journal-title":"J Math Phys"},{"key":"10_CR141_10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/0095-8956(90)90127-L","volume":"48","author":"DN Yetter","year":"1990","unstructured":"Yetter DN (1990) On graph invariants given by linear recurrence relations. J Combin Theory B 48:6\u201318","journal-title":"J Combin Theory B"},{"key":"10_CR142_10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.2307\/2153985","volume":"334","author":"T Zaslavsky","year":"1992","unstructured":"Zaslavsky T (1992) Strong Tutte functions of matroids and graphs. Trans Am Math Soc 334:317\u2013347","journal-title":"Trans Am Math Soc"}],"container-title":["Structural Analysis of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-8176-4789-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:34:31Z","timestamp":1676687671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-8176-4789-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"ISBN":["9780817647889","9780817647896"],"references-count":142,"URL":"https:\/\/doi.org\/10.1007\/978-0-8176-4789-6_10","relation":{},"subject":[],"published":{"date-parts":[[2010,9,16]]},"assertion":[{"value":"16 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}