Irreducibility of the Tutte polynomial of an embedded graph
Combinatorics
2022-12-22 v1
Abstract
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that the Tutte polynomial of a graph is irreducible if and only if the graph is connected and non-separable.
Keywords
Cite
@article{arxiv.2212.10920,
title = {Irreducibility of the Tutte polynomial of an embedded graph},
author = {Joanna A. Ellis-Monaghan and Andrew J. Goodall and Iain Moffatt and Steven Noble and Lluís Vena},
journal= {arXiv preprint arXiv:2212.10920},
year = {2022}
}
Comments
15 pages - this is the authors accepted manuscript / version of record without journal provided formatting