{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T18:46:13Z","timestamp":1770489973597,"version":"3.49.0"},"reference-count":39,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T00:00:00Z","timestamp":1523491200000},"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":[[2018,11]]},"abstract":"<jats:p>We follow the example of Tutte in his construction of the dichromate of a graph (<jats:italic>i.e.<\/jats:italic> the Tutte polynomial) as a unification of the chromatic polynomial and the flow polynomial in order to construct a new polynomial invariant of maps (graphs embedded in orientable surfaces). We call this the surface Tutte polynomial. The surface Tutte polynomial of a map contains the Las Vergnas polynomial, the Bollob\u00e1s\u2013Riordan polynomial and the Krushkal polynomial as specializations. By construction, the surface Tutte polynomial includes among its evaluations the number of local tensions and local flows taking values in any given finite group. Other evaluations include the number of quasi-forests.<\/jats:p>","DOI":"10.1017\/s0963548318000081","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T05:52:25Z","timestamp":1523512345000},"page":"913-945","source":"Crossref","is-referenced-by-count":15,"title":["A Tutte Polynomial for Maps"],"prefix":"10.1017","volume":"27","author":[{"given":"ANDREW","family":"GOODALL","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"THOMAS","family":"KRAJEWSKI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GUUS","family":"REGTS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LLU\u00cdS","family":"VENA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,4,12]]},"reference":[{"key":"S0963548318000081_ref1","doi-asserted-by":"publisher","DOI":"10.4171\/QT\/35"},{"key":"S0963548318000081_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s002080100297"},{"key":"S0963548318000081_ref39","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1932-1501641-2"},{"key":"S0963548318000081_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-8858(03)00041-1"},{"key":"S0963548318000081_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70841-0"},{"key":"S0963548318000081_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4789-6_9"},{"key":"S0963548318000081_ref30","volume-title":"Linear Representations of Finite Groups","author":"Serre","year":"2012"},{"key":"S0963548318000081_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90161-1"},{"key":"S0963548318000081_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"S0963548318000081_ref29","first-page":"329","volume-title":"Graph Theory and Related Topics","author":"Oxley","year":"1979"},{"key":"S0963548318000081_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752506"},{"key":"S0963548318000081_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2017.07.001"},{"key":"S0963548318000081_ref17","volume-title":"Algebraic Topology","author":"Hatcher","year":"2002"},{"key":"S0963548318000081_ref2","volume-title":"Algebraic Graph Theory","author":"Biggs","year":"1993"},{"key":"S0963548318000081_ref9","unstructured":"Chun C. , Moffatt I. , Noble S. and Rueckeriemen R. (2016) Matroids, delta-matroids and embedded graphs. arXiv:1403.0920"},{"key":"S0963548318000081_ref31","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100023173"},{"key":"S0963548318000081_ref11","volume-title":"A Combinatorial Representation for Polyhedral Surfaces","author":"Edmonds","year":"1960"},{"key":"S0963548318000081_ref27","doi-asserted-by":"publisher","DOI":"10.5802\/aif.2157"},{"key":"S0963548318000081_ref38","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199910\/12)15:3\/4<210::AID-RSA2>3.0.CO;2-R"},{"key":"S0963548318000081_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548310000295"},{"key":"S0963548318000081_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565830.013"},{"key":"S0963548318000081_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6971-1"},{"key":"S0963548318000081_ref4","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/83.3.513"},{"key":"S0963548318000081_ref10","unstructured":"DeVos M. J. (2000) Flows on graphs. PhD thesis, Princeton University."},{"key":"S0963548318000081_ref26","first-page":"269","article-title":"Determination of the number of nonequivalent coverings over a compact Riemann surface.","volume":"239","author":"Mednyh","year":"1978","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"S0963548318000081_ref33","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1954-010-9"},{"key":"S0963548318000081_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2015.03.009"},{"key":"S0963548318000081_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-38361-1"},{"key":"S0963548318000081_ref28","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1706"},{"key":"S0963548318000081_ref22","first-page":"293","article-title":"Sur les activit\u00e9s des orientations d'une g\u00e9om\u00e9trie combinatoire.","volume":"20","author":"Las Vergnas","year":"1978","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"S0963548318000081_ref36","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548310000258"},{"key":"S0963548318000081_ref15","first-page":"985","volume-title":"Sitzber. K\u00f6niglich Preuss Akad. Wiss.","author":"Frobenius","year":"1896"},{"key":"S0963548318000081_ref24","unstructured":"Litjens B. (2017) On dihedral flows in embedded graphs. arXiv:1709.06469"},{"key":"S0963548318000081_ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2081"},{"key":"S0963548318000081_ref8","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/bdr034"},{"key":"S0963548318000081_ref32","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-51.6.474"},{"key":"S0963548318000081_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2016.06.003"},{"key":"S0963548318000081_ref25","volume-title":"J. Graph Theory.","author":"Litjens"},{"key":"S0963548318000081_ref34","volume-title":"Graph Theory","author":"Tutte","year":"2001"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548318000081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T18:46:29Z","timestamp":1555094789000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548318000081\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,12]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["S0963548318000081"],"URL":"https:\/\/doi.org\/10.1017\/s0963548318000081","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,12]]}}}