Irreducibility of the Tutte polynomial of an embedded graph. / Moffatt, Iain; Ellis-Monaghan, Joanna; Goodall, Andrew; Noble, Steven; Vena, Lluis.

In: Algebraic Combinatorics, 06.06.2022.

Research output: Contribution to journalArticlepeer-review

Forthcoming

Documents

  • Accepted Manuscript

    Accepted author manuscript, 306 KB, PDF document

  • Iain Moffatt
  • Joanna Ellis-Monaghan
  • Andrew Goodall
  • Steven Noble
  • Lluis Vena

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.
Original languageEnglish
JournalAlgebraic Combinatorics
Publication statusAccepted/In press - 6 Jun 2022

ID: 45456760