English

Types of embedded graphs and their Tutte polynomials

Combinatorics 2023-01-02 v1

Abstract

We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs on surfaces. We give a description of each class in terms of coloured ribbon graphs. We then identify a universal deletion-contraction invariant (i.e., a `Tutte polynomial') for each class. We relate these to graph polynomials in the literature, including the Bollob\'as--Riordan, Krushkal, and Las Vergnas polynomials, and give state-sum formulations, duality relations, deleton-contraction relations, and quasi-tree expansions for each of them.

Keywords

Cite

@article{arxiv.2212.14233,
  title  = {Types of embedded graphs and their Tutte polynomials},
  author = {Stephen Huggett and Iain Moffatt},
  journal= {arXiv preprint arXiv:2212.14233},
  year   = {2023}
}

Comments

This is the authors accepted manuscript / version of record with an unfortunate typo corrected on p24

R2 v1 2026-06-28T07:55:47.736Z