7 citations · 26 across the 13 of their papers we have counts for
16 papers
On the irreducibility and monodromy of Tutte polynomials
Andrew Goodall, Florent Jouve, Jean-Sébastien Sereni
We study algebraic properties of the Tutte polynomial of a matroid and its generalizations to other combinatorially defined bivariate polynomial invariants. Merino, de Mier and Noy…
Homomorphisms between graphs embedded on surfaces
Delia Garijo, Andrew Goodall, Lluís Vena
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the…
Irreducibility of the Tutte polynomial of an embedded graph
Joanna A. Ellis-Monaghan, Andrew J. Goodall, Iain Moffatt +2
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 o…
Tutte's dichromate for signed graphs
Andrew Goodall, Bart Litjens, Guus Regts +1
We introduce the ``trivariate Tutte polynomial" of a signed graph as an invariant of signed graphs up to vertex switching that contains among its evaluations the number of proper c…
A Tutte polynomial for maps II: the non-orientable case
Andrew Goodall, Bart Litjens, Guus Regts +1
We construct a new polynomial invariant of maps (graphs embedded in a compact surface, orientable or non-orientable), which contains as specializations the Krushkal polynomial, the…
On the complexity of generalized chromatic polynomials
A. Goodall, M. Hermann, T. Kotek +2
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for h…