R. Brewster

collaborators

3 papers

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…

math.CO2024

Broadcast independence and packing in certain classes of trees

Richard C. Brewster, Kiara A. McDonald

Given a graph $G = (V, E)$ of diameter $d$ , a broadcast is a function $f : V (G) \to {0, 1, \dots, d}$ where $f (v)$ is at most the eccentricity of $v$ . A vertex $v$ is broadcasting i…

cs.DM2024

List homomorphisms to separable signed graphs

Jan Bok, Richard Brewster, TomÃ¡s Feder +2

The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…

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

Broadcast independence and packing in certain classes of trees

List homomorphisms to separable signed graphs

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