Irreducibility of the Tutte polynomial of an embedded graph

Ellis-Monaghan, Jo.A. and Goodall, A.J. and Moffatt, I. and Noble, Steven and Vena, L. (2021) Irreducibility of the Tutte polynomial of an embedded graph. Technical Report. Birkbeck, University of London, London, UK. (Submitted)

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.

Metadata

Statistics

DownloadsShow export options

Export as XMLJSONCSV

Activity Overview

6 month trend

98Downloads

6 month trend

177Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item