BIROn - Birkbeck Institutional Research Online

    Irreducibility of the Tutte polynomial of an embedded graph

    Ellis-Monaghan, J. and Goodall, A. and Moffatt, I. and Noble, Steven and Vena, L. (2022) Irreducibility of the Tutte polynomial of an embedded graph. Algebraic Combinatorics 5 (6), pp. 1337-1351. ISSN 2589-5486.

    48836a.pdf - Published Version of Record
    Available under License Creative Commons Attribution.

    Download (833kB) | Preview


    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.


    Item Type: Article
    Keyword(s) / Subject(s): Bollobás–Riordan polynomial, delta-matroid, irreducible, ribbon graph, ribbon graph polynomial, separable, Tutte polynomial
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Steven Noble
    Date Deposited: 03 Jan 2023 07:01
    Last Modified: 09 Aug 2023 12:53


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item