G. MacGillivray

collaborators

2 papers

math.CO2026

The complexity of frugal digraph homomorphisms

Stefan Bard, Gary MacGillivray, Jacobus Swarts

For an integer $t \geq 1$ , a homomorphism of a digraph G to a digraph $H$ is $t$ -frugal if no more than $t$ in-neighbours of any vertex of $G$ have the same image. There is a dicho…

math.CO2025

A dichotomy theorem for $I^$ -switchable $H$ -colouring on $m$ -edge coloured graphs

Richard Brewster, Arnott Kidner, Gary MacGillivray

Let $G$ be a graph in which each edge is assigned one of the colours $1, 2, \dots, m$ , and let $I^$ be a subgroup of $S_{m}$ . The operation of switching at a vertex $x$ of $G$ with…

The complexity of frugal digraph homomorphisms

A dichotomy theorem for I^-switchable H-colouring on m-edge coloured graphs

A dichotomy theorem for $I^$ -switchable $H$ -colouring on $m$ -edge coloured graphs